Method and apparatus for converting heterogeneous databases into standardized homogeneous databases

ABSTRACT

A method, an apparatus, and a system for configuring, designing, and/or implementing database tables are detailed that provides a framework into which a remainder of database tables is developed. Also detailed is a method to develop this framework of database tables. This so developed framework provides a platform for converting multiple independent heterogeneous databases into standardized homogeneous databases.

CROSS REFERENCE TO RELATED APPLICATION(S)

The present application is a continuation in part of and claims thepriority of U.S. patent application Ser. No. 12/500,957, filed on Jul.10, 2009, inventor and applicant Robert Mack, such that Jul. 10, 2009 isthe earliest priority date for the present application.

FIELD OF THE INVENTION

This invention relates to improved methods and apparatus concerning thedesign and development of data models and the deployment of databasetables and other associated database objects.

BACKGROUND OF THE INVENTION

Database development is a relatively new technology dating back toaround the 1960's. In 1976, the concept of entity-relationshipdiagramming and data modeling was developed. One function of data modelsis to design the structures of databases such as database tables anddatabase columns. By the late 1980's, specialized databases, referred toas data warehouses, where being designed for the purpose of optimizingreport generation. The data warehouse database uses data redundancy anddata aggregation to improve data retrieval speed.

Alternative data model development methods have since been developedthat are variations of the entity-relationship diagrams. Thesealternative data model development methods are also computer basedsoftware applications that include the Unified Modeling Language methodand the Object-Oriented Data Modeling method. Also, some vendors supplyskeletal data models stored in computer memory that are incomplete datamodels usually specific to certain industries. The purchased skeletaldata models are then completed in computer memory where more specificdata requirements are implemented.

SUMMARY OF THE INVENTION

One or more embodiments of the present invention include a method ofplacing data into an individual column of a database table in a computermemory and grouping the data into a single database record, in acomputer memory. A computer processor may be programmed by computersoftware stored in computer memory, to place data into an individualcolumn, automatically or in response to a computer user's inputs througha computer interactive device, such as computer keyboard or computermouse.

The method may further include the addition of more columns into adatabase table, in a computer memory, for the purposes of integratingdata records in multiple database tables, in a computer memory, asimplemented for example by a computer processor programmed by computersoftware, stored in computer memory. In addition, a method in accordancewith an embodiment of the present invention may include the creation, ina computer memory, of database access paths to aid in the combination ofdata records stored in multiple said database tables in a computermemory, as implemented for example by a computer processor programmed bycomputer software, stored in computer memory. A further method inaccordance with an embodiment of the present invention may include theformation of one or more database bridges, in computer memory, thatprovide database access paths between two or more databases, asimplemented for example by a computer processor programmed by computersoftware, stored in computer memory.

The concern for the data set integration method of one or moreembodiments of the present invention is in developing reusablefoundation database structures. One or more embodiments of the presentinvention develops standard foundation database tables in a computermemory that may be incorporated into many databases in computer memorythus providing a data sharing functionality to these so developeddatabases. In addition, reusable standard computer-based methods forpopulating data records for each standard foundation database table arecreated and utilized. These standard methods are used, in at least oneembodiment by a computer processor programmed by computer software inaccordance with embodiments of the present invention to create datarecords for these standard foundation database tables in multipledatabases where the data records are stored in computer memory.

A database integration method in accordance with an embodiment of thepresent invention, in one or more computer memories, becomes importantas it provides additional functionality in the definition of alldatabase tables, in one or more computer memories. That is, with adatabase integration method of one or more embodiments of the presentinvention, independently designed databases are converted, for exampleby a computer processor programmed by computer software stored incomputer memory, into standardized databases in one or more computermemories. The resulting database data records are more universallyidentified since all database tables are considered instead ofdeveloping database tables as totally independent data structures.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a diagram of an apparatus in accordance with an embodimentof the present invention;

FIG. 2 depicts a prior art simple entity-relationship diagram of acountry data entity and a state data entity and a data entityrelationship linking the two data entities together that can bedisplayed on a display device of the apparatus of FIG. 1 or stored in acomputer memory of the apparatus of FIG. 1;

FIG. 3 depicts a prior art pair of database tables linked by a foreignkey constraint that was instantiated from the entity-relationshipdiagram shown in FIG. 2 and populated with data values that can bedisplayed on a display device of the apparatus of FIG. 1 or stored in acomputer memory of the apparatus of FIG. 1;

FIG. 4 depicts a prior art spreadsheet of data retrieved from thepopulated database shown in FIG. 3;

FIG. 5 depicts a prior art independently designed heterogeneousentity-relationship diagram;

FIG. 6 depicts a prior art independently designed database that isinstantiated from the data model that contains the entity-relationshipdiagram shown in FIG. 5;

FIG. 7 depicts the result of converting the data model shown in FIG. 5into a standardized homogeneous data model, in accordance with anembodiment of the present invention, that can be displayed on a displaydevice of the apparatus of FIG. 1 or stored in a computer memory of theapparatus of FIG. 1;

FIG. 8 depicts the result of converting the database as shown in FIG. 6into a standardized homogeneous database, in accordance with anembodiment of the present invention, that can be displayed on a displaydevice of the apparatus of FIG. 1 or stored in a computer memory of theapparatus of FIG. 1;

FIG. 9 shows a master flow chart depicting a process, which can beimplemented by the computer processor of FIG. 1, for converting anexisting database, such as the database shown in FIG. 6, into astandardized homogeneous database, such as that converted database shownin FIG. 8;

FIG. 10 shows a detailed flow chart, which details a subset of themaster flow chart shown in FIG. 9, used to determine which unifiedboundary data entities may be added to an existing entity-relationshipdiagram, such as the entity-relationship diagram database shown in FIG.5, to convert the existing entity-relationship diagram into astandardized unified entity-relationship diagram such as theentity-relationship diagram shown in FIG. 7;

FIG. 11 shows a detailed flow chart, which details a subset of themaster flow chart shown in FIG. 9, depicting the process of creatingunified boundary data entities;

FIG. 12 depicts a single unified boundary data entity that is created inaccord with the detailed flow chart shown in FIG. 11;

FIG. 13 shows a detailed flow chart, which details a subset of themaster flow chart shown in FIG. 9, depicting the process of combining aunified boundary data entity with any existing entity-relationshipdiagram;

FIG. 14A depicts an entity-relationship diagram of an independentlydesigned heterogeneous data model;

FIG. 14B depicts the same entity-relationship diagram as shown in FIG.14A after a single unified boundary data entity has been added, such asfor example by the computer processor of FIG. 1, as programmed bycomputer software stored in computer memory;

FIG. 15 shows a detailed flow chart, which details a subset of themaster flow chart shown in FIG. 9, depicting the process of modifying anexisting database containing populated database tables to include one ormore populated unified boundary database tables;

FIG. 16 depicts a populated unified boundary database table that wasinstantiated from the entity-relationship diagram shown in FIG. 12;

FIG. 17A depicts a prior art populated database table;

FIG. 17B depicts the populated database table from FIG. 17A after aunified boundary database table has been added along with a foreign keyconstraint that relates the two database tables;

FIG. 18 depicts a flow chart of a procedure for populating foreign keydatabase columns inherited from a unified boundary database table;

FIG. 19 shows a flow chart, which details a subset of the master flowchart shown in FIG. 9, depicting the addition of homogenous summarydatabase tables to a database containing populated unified boundarydatabase tables;

FIG. 20 depicts an entity-relationship diagram where a singlehomogeneous summary data entity has been added to theentity-relationship diagram shown in FIG. 14B;

FIG. 21 depicts the populated homogeneous summary database table and thepopulated unified boundary database table along with the foreign keyconstraint that relates the two database tables, which were allinstantiated from the data model containing the entity-relationshipdiagram shown in FIG. 20;

FIG. 22A depicts two prior art independent heterogeneous databases in asingle computing environment such as the computing environment shown inFIG. 1;

FIG. 22B depicts the two databases in a single computing environmentfrom FIG. 22A after both databases were each converted into astandardized homogeneous database, in accordance with an embodiment ofthe present invention.

DETAILED DESCRIPTION OF THE DRAWINGS

In the present application the following terms have the followingdefinitions:

Alternate key—In an entity-relationship diagram, a data entity'salternate key is a unique key, stored in one or more computer memories,such as computer memory 8 in FIG. 1 that is declared in theentity-relationship diagram as an alternate method of selecting uniquedata records from a resultant database table in one or more computermemories. In FIG. 1, the computer memory 8 may actually include one ormore computer memories. A database table's alternate key is a uniqueindex placed upon the database table in one or more computer memories bythe database management system implemented by a computer processor, suchas computer processor 4 in FIG. 1 and used to select data records fromthe database table.

Business key—In an entity-relationship diagram, a data entity's businesskey is typically based solely upon one or more data attributes ofsignificance to a business. The business key may also be declared as aprimary key or as an alternate key by a computer user utilizing a CASEtool or data modeling tool that is executing on a computer processorsuch as in one or more computer memories. There may be one or morebusiness keys declared, for each data entity in the data model and allbusiness keys may be database instantiated by executing computersoftware such as a database management system into the database asunique indexes associated with database tables.

CASE tool—A CASE tool is a computer software package that is executed ona computer processor, such as computer processor 4 of FIG. 1, for thepurpose of developing and documenting data systems. CASE stands forComputer Aided Software Engineering. Generally, speaking, most CASEtools include a data modeling component to develop data models, todevelop entity-relationship diagrams, to manage metadata and to aid indesigning and implementing database tables.

Database—A database is generally a grouping of data values typicallystored in a computer memory and organized for convenient access. Morespecific to this patent application, a database is a defined datastructure, generally stored in computer memory, comprised of databasetables, database columns, database indexes, foreign key constraints andother database objects defined using a computer-based databasemanagement system. In the present application, a database managementsystem is a computer software application for maintaining databaseobjects as well as database data values.

Database access path—A database access path results from the definedmetadata commonality and from the defined data value commonality thatallows for the combination of data records in computer memory from twodatabase tables. The combined data records are formed into a singleresult set of metadata and data values that can be displayed on thedisplay device 6 of the apparatus 1 of FIG. 1 or stored in a computermemory 8 of the apparatus 1 of FIG. 1. Within a single database, thesedatabase access paths are often defined as foreign key constraintswithin the computer-based database management system that are stored incomputer memory, such as in computer memory 8.

Database bridge—A database bridge is constructed by adding the samedatabase table to each of two different databases that can be stored inthe computer memory 8 of the apparatus 1 of FIG. 1. This added databasetable will provide metadata commonality to each of the two previouslyheterogeneous databases. The added database table must be populated withdata records for both databases using a standard method so that the datarecords are consistent and are a basis of data set commonality for bothdatabases. In addition to the added database table, foreign keyconstraints between the added database table and other existing databasetables in each database will provide one or more database access pathsinto each database from the added database table. This added databasetable provides a bridge between the two previously isolated networks ofdatabase access paths within each database that can be stored in thecomputer memory 8 of the apparatus 1 of FIG. 1. The database bridge is amethod used to promote the combination of data records between two datasets that were previously isolated in two databases.

Database index—A database index is a type of database object stored incomputer memory that is associated to a database table. A database indexmay be comprised of a single database table column or be comprised ofmultiple database table columns from the same database table. A databaseindex may be designed as a unique index, which may use a key data valueonly once per database table, or designed as a non-unique index, whichmay repeat key data values in that database table. Database indexes areused to maintain the data value integrity of the database table datarecords as well as to aid in the rapid retrieval of specific datarecords from a database table.

Database integration—Database integration is the process of designingnew databases or converting existing databases to conform to a set ofmetadata standards and a set of data record standards. The result ofdatabase integration is a group of databases that can be stored in acomputer memory, such as the computer memory 8 of the apparatus 1 ofFIG. 1, where their data sets may be combined into a consistent data setacross the group of databases.

Database instantiation—The process of database instantiation is used toconstruct database objects that are available within a database throughuse of, for example, interactive device 2 and computer processor 4 shownin FIG. 1 to a database user. These database objects are created,maintained and deleted by a typically very complex computer softwareprogram referred to as a database management system. A databasemanagement system is a computer program that executes on a computer orcomputer processor and that may be used to support multiple databases onone or more computers or computer processors. A database created under adatabase management system is stored in computer memory. This databaseinstantiation process is often controlled by another computer softwareprogram such as a data modeling tool or a CASE tool. CASE stands forComputer Aided Software Engineering. Once a data model (“data model” isdefined later) has been developed within the data model tool or the CASEtool, that data model is forward engineered. This process of forwardengineering, which may be programmed on a computer program, instructsthe database management system to construct these database objects suchas database tables, database table indexes, and database tableconstraints. The process of database instantiation converts the datamodel objects and metadata into database objects. Each data entity ofthe data model is converted into a database table, which is stored incomputer memory, such as in computer memory 8 shown in FIG. 1, whereeach data attribute of the data model becomes a column within a databasetable stored in computer memory. The metadata associated with each dataattribute of the data model are used to define the data types for eachdatabase column, as well as the column's data lengths, the column'sprecision, and whether the column must be populated with data for eachdata record. The data model keys such as primary keys, alternate keys,and foreign keys, become database table unique and non-unique indexes.

Database referential integrity—Referential integrity is a process, mostoften managed by a computer-based database management system databasethat is stored in a computer memory of the apparatus of FIG. 1, used toinsure the consistency and integrity of data values stored within acomputer memory as a database. Database referential integrity is relatedto joining data records stored in a database table to the data recordsstored in another database table via a database access path ofteninstantiated in a database as a foreign key constraint.

Data entity—A data entity is a basic component of an entity-relationshipdiagram that can be displayed on the display device 6 of the apparatus 1of FIG. 1 and that is stored in a computer memory such as the computermemory 8 of the apparatus 1 shown in FIG. 1. Each data entity of theentity-relationship diagram will be given a name to uniquely identifythat data entity from all other data entities of the entity-relationshipdiagram. When the database is formed from the entity-relationshipdiagram, each data entity typically is instantiated in the database as asingle database table in computer memory. In addition, a data entityincludes a list of data attributes, which, when the database is formed,becomes the list of database columns. Each data entity generally has aprimary key declared based upon one or more of the data attributeslisted for that data entity. Each data entity may also have alternatekeys declared also based upon one or more of the data attributes listedfor that data entity. When the database is formed from theentity-relationship diagram, the primary key and the alternate keys aretypically instantiated as unique database table indexes in computermemory.

Data entity relationship—A data entity relationship is a connector orlink, which is stored in one or more computer memories, such as incomputer memory 8, between two data entities in an entity-relationshipdiagram. A data entity relationship provides a means of joining dataattributes of one data entity with data attributes of another dataentity. The data entity relationships are depicted graphically inentity-relationship diagrams as lines that begin attached to a firstdata entity and end with a filled circle on the dependent data entity. Adata entity relationship causes the CASE computer software tool toduplicate the primary key data attributes or to duplicate an alternatekey data attribute from a first data entity into the data entity that isdependent on the first data entity. The computer processor 4 may beprogrammed by a CASE tool computer software to permit a user viainteractive device 2 to make relationships between data entities. Theuser, via interactive device 2, may select which of a first dataentity's key data attributes will be duplicated by the CASE Toolcomputer software. These duplicated key data attributes are referred toas a foreign key data attributes in the dependent data entity. Upondatabase instantiation, a data entity relationship from theentity-relationship diagram is instantiated as a foreign key constraint,in one or more computer memories, such as computer memory 8.

Data model—A data model is a computer implemented repository ofmetadata, including entity-relationship diagrams, which may contain dataentities, data attributes and data entity relationships that can bedisplayed on the display device 6 of the apparatus 1 of FIG. 1 or storedin the computer memory 8 of the apparatus 1 of FIG. 1. Data models are amethod of designing database structures for one or more databasemanagement systems. When the data model is instantiated into a database,the data entities usually become a database table, while the dataattributes become database columns and the data entity relationshipsbecome foreign key constraints.

Data modeling tool—A data modeling tool is a computer software programor package that is executed on a computer processor, such as thecomputer processor 4, for the purpose of developing data models. Thedata modeling tool supports the forward engineering of theentity-relationship diagram and metadata to a database instantiated on acomputer that is executing the database management system of computersoftware.

Data record—A data record is a single row of data values in a databasetable stored in a computer memory, such as computer memory 8. Each datarecord will usually include a primary key value for uniquely identifyingthat data record. In addition, a data record may include alternate keyvalues to provide alternative methods for finding unique data records ina computer memory, such as computer memory 8 in FIG. 1. A data recordmay also include foreign key values to allow linking of data recordsfrom multiple database tables.

Data record granularity—Data record granularity is a characteristic of adata record that details the scale or the level of detail represent in adata set. The greater the data record granularity, the deeper the levelof detail represented by the data record. For example, a hierarchy oftime periods with three levels of data record granularity may be definedwithin a database to represent a year, a month, and a day. In thisexample, a data record that represents a year time period is the leastgranular type of data record representation while a data record thatrepresents a day time period is the most granular type of data recordrepresentation. Dimensional database tables most often contain datarecords that represent multiple discrete levels of data recordgranularity.

Data Registry—A data registry, for the purposes of this patentapplication, is a reference data set, stored in a computer memory thatis established for the purpose of uniquely identifying and defining acomplete set of data records that represent some specific subject area.For example, the International Standards Organization publishes manydata registries such as the ISO 3166 data registry of standard countrycodes. The ISO 3166 data registry is composed of a set of data records,where this set of data records identify and define every recognizedcountry in the world. Each data record contains two data field. Thefirst data field is named the country code and each country code datavalue is used to uniquely identify one country. The second data field isnamed country name and each country name data value defines a singlecountry. The ISO 3166 data registry of country codes may be used in manydatabases.

Data value—A data value is an alphanumeric string stored in a specificlocation in a computer memory such as a named data field. For example, adata value may be stored in a data field of a data entry form in acomputer memory or in a specific cell of a spreadsheet or in a specificdata column of a specific data record of a database table in computermemory. The interpretation of the actual value of the alphanumericstring is dependent upon the data type of the data field. For example,if the data type of a data field is numeric, only valid numeric valueswill be accepted into the data field.

Dimensional data—Dimensional data is reference data or master data thatrepresents a hierarchy of several discrete levels of data recordgranularity. For example, dimensional data for geographical areas couldhave discrete levels of data record granularity such as the continentlevel, the country level, and the state level.

Entity-Relationship diagram—An entity-relationship diagram (ERD) is agraphical depiction of a database design that includes data entities,and includes data entity relationships that can be displayed on thedisplay device 6 of the apparatus 1 of FIG. 1 or stored in a computermemory 8 of the apparatus 1 of FIG. 1. The depicted data entitiesrepresent potential database tables to be instantiated into a database.The depicted data entity relationships represent potential foreign keyconstraints to be instantiated into the same database and used tomaintain referential integrity between the instantiated database tables.An ERD is always stored within a data model along with other metadatarequired to instantiate a database.

Foreign key—A foreign key provides a link, via a data entityrelationship between two data entities in an entity-relationship diagramthat is stored in computer memory. The data attributes from the primarykey or a selected alternate key of a first data entity are duplicatedinto a second data entity which is now dependent upon the first dataentity. These duplicated data attributes are referred to as foreign keydata attributes. This link or data entity relationship, when databaseinstantiated, instantiates a foreign key constraint that enforcesreferential integrity between the two database tables that result fromthe first data entity and from the dependent second data entity. Foreignkey data attributes, when database instantiated, become foreign keydatabase columns.

Foreign key constraint—A foreign key constraint is declared in adatabase management system as a means of implementing and maintainingdatabase referential integrity between two data sets each of which ismost often contained within different database tables. A foreign keyconstraint is normally designed in an entity-relationship diagram as adata entity relationship usually between two data entities. The firstdata entity, often referred to as the parent data entity, contributesone or more key data attributes to the second data entity, which isoften referred to as the dependent data entity. In the parent dataentity, a unique key, such as the primary key or an alternate key, hasits data attributes copied into the dependent data entity's set of dataattributes. These copied data attributes are referred to as the foreignkey data attributes in the dependent data entity. When theentity-relationship diagram is instantiated into a database, the parentdata entity becomes the parent database table, the dependent data entitybecomes the dependent database table and the data entity relationshipbecomes the foreign key constraint. The foreign key data attributes, inthe dependent data entity, are instantiated as foreign key databasecolumns in the dependent database table. Foreign key constraints arestored in computer memory and are used by the database management systemto enforce database referential integrity rules for creating, updatingand deleting data records. Foreign key constraints are extremelyimportant within a database because only data record sets with enforcedreferential integrity may be joined to form a consistent, combined setof data records. Each foreign key constraint in a database provides abidirectional database access path between two database tables.

Fundamental business key data attribute—For the purposes of this patentapplication, a fundamental business key data attribute is a type ofbusiness key data attribute that may be used by itself or in combinationwith other business key data attributes to uniquely identify a unifiedboundary data entity. Fundamental business key data attributes have thefollowing characteristics:

-   -   A fundamental business key data attribute is independent of any        other data attributes in that it is not derived from other data        attributes and may not be decomposed into multiple significant        data attributes.    -   A fundamental business key data attribute may be defined at the        most granular level of detail available.    -   A fundamental business key data attribute is a well-known        defined standard.    -   fundamental business key data attribute is a singularly defined        standard.

There are several types of fundamental business key data attributes. Thefirst type of fundamental business key data attributes is based uponfundamental measurements such as time, such as latitude and longitude,such as temperature, and such as weight all of which are classified asabsolute fundamental business key data attributes. A second type offundamental business key data attribute is based upon data registries. Adata registry is a unique identifier that is assigned to something ofsignificance. If that something of significance is a book, the DeweyDecimal System may be used as the data registry. If that something ofsignificance is products, the Universal Product Code (UPC) may be usedas a data registry for products. In the case of currency types, the ISO4217 is an international standard data registry developed and maintainedby the International Standards Organization (ISO) for the variouscurrencies used around the world.

Fundamental business key database column—A fundamental business keydatabase column is a column of a single database table that results fromthe database instantiation of a fundamental business key data attribute.The fundamental business key database column will also normally be apart of a unique database index that is associated with that databasetable.

Fundamental measurement—A fundamental measurement is a measurement basedupon ordered qualitative observations that are not derived from othermeasurements. Examples of fundament measurements are the measurement oftime, of weight, of distance, or of temperature. Within this patent, themeasurement of a period of time such as a calendar year, or a calendarweek are based upon the fundamental measurement of time for the start ofthe time period and for the end of the time period. While a residentialpostal address is not a fundamental measurement, because it is not basedupon ordered qualitative observation, the latitude and longitudecoordinates of the same residence would be considered a fundamentalmeasurement.

Independent heterogeneous database—An independent heterogeneous databaseis a database that is designed without intended metadata commonality andwithout intended data set commonality with other databases. Most priorart databases are unique and are heterogeneous having no intendedmetadata commonality and no intended data set commonality with otherdatabases. Also, databases designed by independent database design teamswith no common metadata standards or with no common data standardsresult in independent heterogeneous databases. Currently, there are nogeneral or universal database design standards for both metadata anddata sets.

Independent heterogeneous entity-relationship diagram—An independentheterogeneous entity-relationship diagram is an entity-relationshipdiagram that is contained within a data model where the repository ofmetadata for that data model has been developed independent of otherexisting repositories of metadata.

Local boundary data entity—A local boundary data entity, of anentity-relationship diagram, represents the outer boundary of dataentities upon which all other data entities are dependent. By analogy,the local boundary data entities are to an entity-relationship diagramwhat the edge pieces of a picture puzzle are to the puzzle itself. Thelocal boundary data entities form the border or the outer edge of theentity-relationship diagram. In part, the local boundary data entitiesare the ultimate parent data entities of the data model. Once the datamodel is instantiated into a database, any database table instantiatedfrom a local database boundary data entity becomes a local boundarydatabase table.

Primary key—A primary key is comprised of one or more data attributeswithin a data entity that are declared using a CASE tool or a datamodeling tool executing on computer processor 4 which is programmed tostore the declared primary key in computer memory, such as computermemory 8 of FIG. 1. The primary key of a data entity is the primarymethod of uniquely identifying data records within a database table. Ina database, the primary key is instantiated as the primary unique indexof the database table that was instantiated from the data entity. Theprimary unique index is used as a means of rapidly selecting unique datarecords from the database table.

Repository of metadata—A repository of metadata is a compilation ofinformation about data. In this patent, the repository of metadata iscompiled to support the design and the formation of database structuresand to support the creation data records for various database tables. Tosupport the design of database structures, data entities, dataattributes, data entity relationships, primary keys, and alternate keyare examples of metadata defined in a data model. Theentity-relationship diagrams developed within data models are alsoconsidered to be a form of metadata complied in the repository ofmetadata. To support the formation of database structures, databasetables, database columns, foreign key constrains and unique indexes areexamples of metadata defined in the Database Management System which isa software application. Processes used to populate data records intodatabase tables may also stored in the repository of metadata. Arepository of metadata may also be referred to as a dictionary ofmetadata within this patent.

Standardized homogeneous database—For this patent, a standardizedhomogenous database is a database, stored in computer memory, thatincludes one or more unified boundary database tables. In addition, thestandardized homogeneous database may also include database tables thatconform to a metadata standard developed for use specifically with theunified boundary database tables. This metadata standard is detailed inthe unified metadata dictionary. A standardized homogeneous database isoften instantiated from a standardized homogeneous data model.

Summary database table—For this patent, a summary database table is adatabase table that is not a unified boundary database table, but thesummary database tables do conform to the metadata standard developedfor use specifically with unified boundary database tables. A summarydatabase table, that is stored in computer memory, will normally containaggregate data records composed from the transactional data records ofprior art database tables. The summary database tables along with theunified boundary database tables combine to form the homogeneousdatabase layer for a standardized homogeneous database. In a data model,summary data entities are most often used with data warehouse typeentity-relationship diagrams. In a data warehouse typeentity-relationship diagram, data entities are normally classified aseither dimensional data entities or fact data entities. The dimensionaldata entities contain reference data or master data while the fact dataentities normally contain quantitative type data. Fact data entities arenormally dependent upon dimensional data entities as they inheritforeign key data attributes from the dimensional data entities. A factdata entity of a data warehouse data model is a form of summary dataentity. Aggregate data entities formed or mathematically derived fromdata attributes of fact data entities of a data warehouse typeentity-relationship diagram are also considered summary data entities.When database instantiated, the summary data entities form summarydatabase tables within the database.

Surrogate primary key—A surrogate primary key is a type of data entityprimary key based upon a single numeric data attribute or a databasetable primary key that is based upon a single numeric database columnpopulated with a unique set of numeric values. The surrogate primary keyhas no business significance and is therefore not a part of a businesskey.

Ultimate parent data entity—Within a data model, ultimate data entitiesare data entities that do not inherit foreign key data attributes fromother data entities with the exception that:

-   -   An ultimate parent data entity may inherit code type data        attributes from one or more decode type data entities. Decode        data entities are an artifact of a data normalization process        for the removal of repeating data values from a set of data        records. For example, state codes are repeatedly found in a set        of postal address data records and as such may be removed to a        decode data entity.    -   An ultimate parent data entity may recursively inherit data        attributes from itself.        On the other hand, ultimate parent data entities contribute        foreign key data attributes to other data entities. Ultimate        parent data entities are always a major part of the local        boundary data entities of any data model.

Unified boundary—In an entity-relationship diagram, a unified boundarydata entity is a reusable data entity designed to represent the outermost boundary or the border of all possible data entities. A completeset of unified boundary data entities will completely encapsulate allother data entities within any data model. When unified boundary dataentities are instantiated into a database, the resultant unifiedboundary database tables define the outer edge for the database.Furthermore, unified boundary database tables are intended to form theouter edge for any database and thus the basis for integrating datarecords from multiple independently designed databases that now includethe same unified boundary database tables.

Unified metadata dictionary—For this patent, the unified metadatadictionary is a repository of metadata used to define data entities anddata attributes that, along with the unified boundary data entities,will form the homogeneous layer for multiple data models. Thisrepository of metadata may be displayed on a display device of theapparatus of FIG. 1 or stored in a computer memory of the apparatus ofFIG. 1. When a data model based upon unified boundary data entities andunified metadata defined data entities is instantiated into a databasethat is stored in computer memory, that database will have the metadatacommonality needed to share data records with other so defineddatabases.

In accordance with at least one embodiment of the present invention, amethod is provided, which can be called a “method to create standardizedhomogenous databases”. This method is a method for configuring,designing, and/or implementing database tables and data models in one ormore computer memories, such as computer memory 8 of FIG. 1 which givesa person who defines data models and database tables a predefinedframework into which the remainder of the data entities and databasetables are developed.

FIG. 1 shows a diagram of an apparatus 1 in accordance with anembodiment of the present invention. The apparatus 1 includes aninteractive device 2, a computer processor 4, a display device 6, and acomputer memory 8. Computer memory 8 may include any type of computermemory, including long term memory such as disk memory in addition tocomputer random access memory which may lose its values when power isremoved. The computer memory 8 may include one or more computermemories. The interactive device 2, the display device 6, and thecomputer memory 8 communicate with the computer processor 4 viacommunications links 2 a, 6 a, and 8 a respectively, which may beelectronic, computer software, optical, wireless or any other type ofcommunications links. The computer processor 4 may be programmed bycomputer software to implement the method to create multiplestandardized homogenous databases in accordance with the presentinvention to create databases in the computer memory 8, such as shown byFIG. 1.

FIG. 2 shows ERD (entity-relationship diagram) 200, which may be storedin the computer memory 8 of FIG. 1. The ERD 200 contains two entities,data entities 202 and 204, combined with a single data entityrelationship 206 that connects these two data entities. In thisrepresentation of an ERD, ERD 200, each of data entities 202 and 204 arerepresented by a rounded-corner rectangle while the data entityrelationship 206 is represented by a line terminated with a filledcircle 206 a. Each data entity, such as each of 202 and 204, representsa group of related data attributes, such as the data attribute 210,which is named country name, and data attribute 208, which is namedcountry abbreviation, for data entity 202. In this notation of dataentities, the data attributes above a line in the rounded-cornedrectangle, such as for example, above line 202 a for data entity 202,are declared to be the primary key of the data entity. The primary keydata attributes of each data entity are also denoted as such by the (PK)which follows the data attribute's name. This primary key is a uniqueidentifier for the data entity. In addition to the data entity's primarykey, each data entity may have zero, one or more alternate keys defined.In FIG. 2, both data entities 202 and 204 contain a single alternate keydenoted by the (AK1) following the alternate key's data attributes. Indata entity 202, the alternate key is declared upon the single dataattribute 210, which is named country name. In data entity 204, thealternate key is a composite alternate key composed from the dataattribute 212, which is named country abbreviation, and data attribute216, which is named state name. The data entity relationships ofentity-relationship diagrams, such as ERD 200, depict a link, normallybetween two data entities, that allow data attributes from a first dataentity, such as data entity 202, to be related to data attributes fromthe second data entity, such as data entity 204.

Data entity relationship 206, shown in FIG. 2, links the first dataentity 202 to the second data entity 204. Note that the data entity 204contains data attribute 212, denoted by (FK). Data attribute 212 isinherited from the primary key of the data entity 202, which is dataattribute 208. This inheritance of a first data entity's primary keydata attributes or one of that data entity's alternate key dataattributes into a second data entity is referred to as a foreign keythus the denotation of (FK).

FIG. 3 is database 300 that results from the database instantiation ofthe data model 200 depicted in FIG. 2. Databases table 302 and 304 areinstantiated into database 300 from data entity 202 and 204 respectivelyof ERD 200 shown in FIG. 2. The primary key index of database table 302is based upon database column 310, which is instantiated from primarykey data attribute 208 of ERD 200. Database table 304 is instantiatedinto database 300 from data entity 204 in FIG. 2. The primary key indexfor database table 304 is a composite index based upon database columns320 and 322, which are instantiated from primary key data attributes 212and 214 of EDR 200.

Beyond the database tables, foreign key constraints are anotherimportant type of database object that is instantiated into anyrelational database. Foreign key constraint 306 of database 300, shownin FIG. 3, is instantiated from data entity relationship 206 of ERD 200shown in FIG. 2. Foreign key constraint 306 of database 300 shown inFIG. 3 maintains database referential integrity between database column310 of database table 302 and database column 320 of database table 304.Once a foreign key constraint is declared, the database managementsystem will enforce the database referential integrity rules for thatforeign key constraint.

In any relational database, the foreign key constraints are veryimportant. Foreign key constraints maintain both the databasereferential integrity of the data records and provide bidirectionaldatabase access paths between database tables. It is important to notethat database referential integrity and database access paths are onlymaintained within a single database. Prior art databases do not allowdatabase referential integrity across databases and do not providedatabase access paths between databases.

FIG. 4 depicts spreadsheet 400 of a data set that results from joiningthe data records from database table 302 to the data records of databasetable 304 from database 300 shown in FIG. 3. In spreadsheet 400, columns404, 406, 408 and 410 results from database columns 310 and 312 ofdatabase table 302 and database columns 322 and 324 from database table304, respectively.

With the rules of database referential integrity enforced in database300, foreign key constraint 306 maintains the bidirectional databaseaccess path between database table 302 and database table 304. Forexample, from data record 314 of database table 302, one may use thedata value “USA” from database column 310, to join with all related datarecords in database table 304. All the data records shown in databasetable 304 that have in database column 320 with the data value “USA”will be retrieved. Also, any data record in database table 304 may nowaccess any related data record in database table 302 via the foreign keyconstraint 306. For example, data record 326 of database table 304 maybe combined with the single data record 314 of database table 302 sincetheir data values in database columns 310 and 320 are equal to the datavalue “USA”.

It is important to note that retrieving data set results from anydatabase is based, in a large part, upon metadata, particularly the nameof the database tables and the names of the database columns within thedatabase tables.

FIG. 5 is a depiction of a prior art ERD (entity-relationship diagram)500 that can be displayed on the display device 6 of the apparatus 1 ofFIG. 1 or stored in a computer memory, such as computer memory 8, of theapparatus 1 of FIG. 1. The ERD 500 is a simplified diagram which showsonly the data entities and the data entity relationships but does notshow the data attributes of each data entity such as data entities501-506, and 508. In ERD 500, there are seven data entities 501, 502,503, 504, 505, 506 and 508. All data entities of an ERD, such as thedata entities shown in FIG. 5, are assigned a unique data entity name.In the ERD 500 of FIG. 5, data entities 501, 502, 503, 504, 505, 506,and 508 are associated to the metadata entity names of T, U, V, W, X, Y,and Z respectively.

ERD 500 is contained in a data model that is stored in computer memory,such as computer memory 8 of FIG. 1. ERD 500 was independently designedas no consideration of its dependence to any other data model influencedits design. Data models that are independently designed or addressdifferent subject areas of data may be referred to as independentheterogeneous data models. Overall data entities and data entityrelationships, as well as data entity names, data attribute names, dataattribute data types and more, differ from one independent heterogeneousdesigned data model to the next. Independent heterogeneous data models,when instantiated, become independent heterogeneous databases.

It is very important to note that each data entity of the ERD 500 ofFIG. 5 has at least one data entity relationship associated with it suchas data entity relationship 507. In very few instances, would a dataentity exist that had no data entity relationships with any other dataentity. As such, and by design, each data entity may be associated toevery other data entity in the data model via the network of data entityrelationships. For example, data entity 508 has a direct relation withdata entity 506 via data entity relationship 507. Data entity 506 has adirect relation with data entity 505 via data entity relationship 509.As a result, data entity 508 has an indirect association to data entity505 via data entity relationship 507, data entity 506, and data entityrelationship 509. Again, within a data model, the vast majority of dataentities have data entity relationships designed to associate any dataentity to any other data entity in the data model.

One critical aspect of data modeling is the design of the network ofdata entity relationships that will be instantiated in the resultingdatabase as foreign key constraints. This network of data entityrelationships is used to maintain the database referential integrity ofthe instantiated database as well as allowing for the combining of datarecords from a combination of database tables.

FIG. 6 depicts database 600 which was instantiated from independentlydesigned ERD 500 shown in FIG. 5. Database 600 is represented as a groupof database tables (601, 602, 603, 604, 605, 606, and 608) and a groupof foreign key constraints (double ended arrows), such as foreign keyconstraint 607. All of these database tables and foreign key constraintsare encapsulated within a database boundary 610. The database 600 isshown in a simplified form in FIG. 6 which shows the database tables andthe foreign key constraints but does not show the database columns foreach database table and all details regarding the database 600 are notshown in FIG. 6.

Database table 601, which is named T in FIG. 6, was instantiated intodatabase 600 from the data entity 501 in ERD 500 shown in FIG. 5.Likewise, database table 602, which is named U in FIG. 6, wasinstantiated into database 600 from the data entity 502 in ERD 500 shownin FIG. 5. Database tables 603, 604, 605, 606, and 608 of database 600as shown in FIG. 6 were instantiated from data entities 503, 504, 505,506, and 508 respectively of ERD 500 shown in FIG. 5. In addition, eachdata entity relationship from the ERD 500 shown in FIG. 5 wasinstantiated into database 600 as foreign key constraints. For example,data entity relationship 507 of ERD 500, which relates data entity 506and data entity 508, was instantiated as foreign key constraint 607 indatabase 600. Foreign key constraint 607 enforces database referentialintegrity and provides a bidirectional database access path betweendatabase table 606 and database table 608 of database 600 as depicted inFIG. 6.

Each database table may be directly or indirectly associated to otherdatabase tables in within a database via foreign key constraints. Eachforeign key constraint enforces referential integrity between twodatabase tables, which as a result, also provides a consistentbidirectional database access path between the same database tables. Forexample, in database 600 shown in FIG. 6, database table 608 has adirect bidirectional access path to database table 606 via foreign keyconstraint 607. Database table 606 has a direct bidirectional databaseaccess path to database table 605 via foreign key constraint 609.Therefore, database table 608 has an indirect bidirectional databaseaccess path to database table 605 via foreign key constraint 607,database table 606, and foreign key constraint 609. Again, within adatabase, the vast majority of database tables have foreign keyconstraints designed to associate any database table to any otherdatabase table within the database.

Each database, such as database 600, contains a consistent data set thatis isolated from other consistent data sets contained within other priorart databases. This data set isolation artifact for prior art databasesis the reason data integration has become so prevalent in theinformation technology industry today. Currently, data integration is aprocess based upon extracting data sets from multiple databases,followed by data transformations of these extracted data sets into acommon data set, and then loading the consolidated common data set intoa different database. A database boundary, such as database boundary610, marks the end of the network of bidirectional database access pathsfor that particular prior art database. A database boundary also marksthe outer limit of the prior art database, such as database 600, that isdenoted by the local boundary database tables. The database boundarycauses data set isolation with each prior art database.

FIG. 7 shows ERD 700, which results from the conversion of theindependently designed ERD 500 shown in FIG. 5 into standardizedhomogeneous ERD 700. FIG. 7 is a simplified diagram that shows only thedata entities and the data entity relationships but does not show thedata attributes associated with each data entity that would be in ERD700. In both ERDs 500 and 700, data entities 501, 502, 503, 504, 505,506 and 508 represent the same data entities. Also, data entityrelationships 507, 509 and 510 represent the same data entityrelationships in both ERD 500 and ERD 700.

This conversion of target ERD 500 into standardized homogeneous ERD 700is accomplished by adding four unified boundary data entities 701, 702,703, and 704 along with summary database table 705 to target ERD 500,the result of which is shown in ERD 700 of FIG. 7. Along with theaddition of these data entities, data entity relationships are alsoadded. For example, unified boundary data entity 701 is related to dataentity 501 via data entity relationship 706. Additionally, unifiedboundary data entity 701 is related to the summary data entity 705 viadata entity relationship 707.

The unified boundary data entities are added to a target ERD to displacethe local boundary data entities. That is, the unified boundary dataentities become the database boundary data entities while the previouslylocal boundary data entities become dependent upon the unified boundarydata entities. The unified boundary data entities are added to convertthe unique local database boundary of the target ERD into a standardunified database boundary that defines a reusable database boundary formultiple databases.

Summary data entities, such as data entity 705 of ERD 700, adds auniversally defined layer of metadata at a level of data aggregationdetermined by the summary data entity's data entity relationships. Dataentities 701, 702, 703, 704, and 705 form a homogeneous layer ofmetadata for ERD 700 which is homogeneous because it is reused inmultiple ERD's. Data entities 501, 502, 503, 504, 505, 506, and 508remain heterogeneous in their metadata.

The overall effect of adding the unified boundary data entities and thesummary data entities to an ERD is very dramatic. ERDs that have localboundaries have no deliberate metadata commonality and as such representindependent and isolated data storage areas. Displacement of the localdatabase boundary data entities of any prior art data model by thereusable unified boundary data entities promotes the integration ofmetadata between any ERD that also have the same reusable unifiedboundary data entities.

When the unified boundary data entities and summary data entities areadded to a target ERD, a data warehouse type ERD has now been integratedwith the existing transactional ERD. In the case of data model 700,which is shown in FIG. 7, the unified boundary data entities 701, 702,703, and 704 would be the dimensional data entities while summary dataentity 705 would be the fact data entity of the data warehouse. Sincethe data warehouse ERD and the transactional ERD are both in the sameintegrated data model, transactional data will also be directlyavailable to the data warehouse without major transformations in theinstantiated database.

FIG. 8 depicts standardized homogeneous database 800, which may bestored in computer memory 8, that results from the databaseinstantiation of ERD 700 shown in FIG. 7. FIG. 8 is a simplified diagramthat shows only the database tables and the foreign key constraints anddoes not show the database columns for each database table or all thedetails of database 800. Database tables 601, 602, 603, 604, 605, 606and 608 of database 800 as shown in FIG. 8 represent the same databasetables as database tables 601, 602, 603, 604, 605, 606, and 608 ofdatabase 600 as shown in FIG. 6. Foreign key constraints 607 and 609 arethe same foreign key constraints in both database 600 and database 800.Database local boundary 610 shown in database 800 contains theheterogeneous database and is the same database boundary as shown indatabase 600. Instantiation of the data model that contains standardizedhomogeneous ERD 700 results in adding four unified boundary databasetables 801, 802, 803 and 804 along with summary database table 805 tothe existing database 600. Along with the addition of these unifiedboundary database tables, foreign key constraints 806, 807, 808, 809,810, 811, 812 and 813 are also added.

Database tables 801, 802, 803, 804 and 805 form a homogeneous layer ofmetadata and data records for database 800. Database tables 601, 602,603, 604, 605, 606, and 608 remain heterogeneous in their metadata, intheir data records and in their data value domains. The four unifiedboundary database tables are used to enrich the reference data in theoriginal database and to provide homogeneous reference metadata to anydatabase. Summary database tables, such as summary database table 805,add a universally defined layer of metadata and a universally definedset of data records to the database. It is important to note that dataaccess paths are available between the original heterogeneous databasetables and the new homogeneous database layer of database tables.

By converting a database, such as database 600 shown in FIG. 6, into astandardized homogeneous database, such as database 800 shown in FIG. 8,a number of heterogeneous database issues are addressed. Heterogeneousdatabases are very well isolated from other databases because of theirheterogeneous metadata and their heterogeneous data records. Basically,heterogeneous databases have no deliberate metadata commonality or datarecord commonality at the level of granularity needed to eliminate thedata isolation. The unique local database boundaries of heterogeneousdatabases are converted to a unified boundary in the standardizedhomogeneous database. This unified boundary becomes the foundation forintegrating metadata and data sets from multiple databases sincestandard reference data values are reused and since standard datastructures are reused in multiple standardized homogeneous databases.

The metadata isolation and the data isolation caused by heterogeneousdatabases make the integration of metadata and data sets very difficult,tedious, and expensive. One common approach is to integrate data frommultiple databases into an integrated database such as a data warehouseor a data integration hub. Unfortunately, the resultant integrateddatabase is itself an isolated heterogeneous database that has nodeliberate commonality with any other database. With the use ofstandardized homogeneous databases, such as database 800 shown in FIG.8, each database is formed upon a foundation of unified boundarydatabase tables. Therefore, all standardized homogenous databasescontain deliberate metadata commonality and data commonality that allowsfor the integration of data across multiple databases.

When a new database system is defined, unified boundary data entitiesmay be incorporated into the data model used to design the new databasesystem. Once the database system design is completed in the data model,that data model may be instantiated into a database management system asa new database. In this case, the unified boundary database tables willbecome an integral part of the database objects available to anydatabase software applications developed to interact with the newdatabase. This newly instantiated database will be a standardizedhomogeneous database because it will have a unified database boundarythat is defined by the combination of unified boundary database tables.

A more challenging use of the unified boundary database tables is toincorporate these database tables into an already existing databasewhere that existing database's tables are already populated with datarecords. This more challenging use is the process for the conversion ofan existing populated prior art database into a standardized homogeneousdatabase. The process for this database conversion is addressed below inflow chart 900 shown in FIG. 9.

FIG. 9 shows flow chart 900 of the process used to convert anyindependent heterogeneous database, such as database 600 as shown inFIG. 6, into a standardized homogeneous database such as database 800 asshown in FIG. 8. The process shown in FIG. 9, can be implemented by acomputer processor, such as computer processor 4 of FIG. 1, executingcomputer software stored in computer memory, such as computer memory 8.In conjunction with this database conversion, the conversion of anindependent heterogeneous ERD into a standardized homogeneous ERD isalso addressed in flow chart 900, such as the conversion of independentheterogeneous ERD 500 to standardized homogeneous ERD700.

Flow chart 900 is comprised of process terminators 901 and 919, ofactivities 903, 907, 910, 915 and 917, of decisions 905, and 912, ofprocess flow lines 902, 904, 906, 908, 909, 911, 913, 914, 916, and 918,and of computer data storage areas 920, 921, 922 and 923. Flow chart 900shown in FIG. 9 is a high-level flow chart that has activities 903, 907,910, 915 and 917 expanded in detailed flow charts 1000, 1100, 1300, 1500and 1900 shown in FIG. 10, FIG. 11, FIG. 13, FIG. 15 and FIG. 19respectively. Computer data storage areas 920, 921, 922, and 923 arepermanent data storage repositories managed by a computer processor,such as computer processor 4 and stored in a computer memory 4 of theapparatus 1 of FIG. 1.

In order to begin the conversion of a target prior art database into astandardized homogeneous database, the computer processor 4 normallybegin with the data model used to instantiate the target database, suchas data model 500 shown in FIG. 5 which is used to instantiate targetprior art database 600 shown in FIG. 6. Data models are most oftendeveloped by one or more persons using a computer software programreferred to as a CASE tool or a data modeling tool. This computersoftware program can be executed by the computer processor 4 of FIG. 1and stored in computer memory 8 also of FIG. 1. Standard prior artdatabase modifications are most often achieved by modifying the targetdata model before instantiating these modified database objects into thetarget database. Within flow chart 900 shown in FIG. 9, this sameapproach is taken. That is, the data model is always modified beforedatabase changes are instantiated.

The database conversion process, depicted in flow chart 900 shown inFIG. 9, begins at terminator 901 that is labeled “Start”. Process flowline 902 indicates that program control initially begins execution atactivity 903. Activity 903 is labeled “Determine where unified boundarydata entities are needed”. Within activity 903, the database to beconverted is analyzed to find where unified boundary data entities wouldbe useful. Activity 903 is performed with a CASE tool or data modelingtool running on the computer processor 4 shown in FIG. 1. Activity 903is detailed in flow chart 1000 as shown in FIG. 10.

Once activity 903 is completed, the database conversion processcontinues as process control is transferred to decision 905 as indicatedby process flow line 904. Decision 905 is used to decide if anappropriate unified boundary data entity has already been developed.Decision 905 is performed with a CASE tool or data modeling tool runningon the computer processor 4 shown in FIG. 1. Each unified boundary dataentity is developed to be part of a set of reusable data entities thatmay be utilized in any data model. If the appropriate unified boundaryhas been developed, process control is passed to activity 910 asindicated by process flow line 909. If an appropriate unified boundaryhas not been developed, process control is passed to activity 907 asindicated by process flow line 906. Activity 907 is executed to developa new unified boundary data entity, which is developed with a CASE toolor data modeling tool running on the computer processor 4 shown inFIG. 1. Activity 907 is detailed in flow chart 1100 which is shown inFIG. 11. Once Activity 907 is completed, process control is passed toactivity 910 as indicated by process flow line 908 combined with processflow line 909.

Activity 910 is the activity of adding a unified boundary data entity tothe target data model that represents the design of the target databaseto be converted. Unified boundary data entities are added to the targetdata model with a CASE tool or data modeling tool running on thecomputer processor 4 shown in FIG. 1. Activity 910 is detailed in flowchart 1300 which is shown in FIG. 13. Once activity 910 is completed,process control is transferred to decision 912 as indicated by processflow line 911 in flow chart 900. Decision 912 is made based upon howmany and which unified boundary data entities are to be added. In somecases, only one unified boundary data entity is sufficient. For othercases, more than one may be required. Please note that unified boundarydata entities may be added to a data model at any time. Just as unifiedboundary database tables may be added to any database at any time. Ifthe analysis of the data model to be converted has not been completed,process control is transferred back to decision 905 as indicated byprocess flow line 913 combined with process flow line 904 shown in flowchart 900 which is depicted in FIG. 9. However, when all the appropriateunified boundary data entities have been added to the target database,process control is passed to activity 915 as indicated by process flowline 914 as shown in flow chart 900 of FIG. 9.

Activity 915 is the beginning of modifying the existing database byinstantiating the unified boundary database tables into the targetdatabase and populating these tables and updating any database tablesthat inherit foreign key database columns from the unified boundarydatabase tables. Activity 915 is performed with database managementsystem software running on the computer processor 4 shown in FIG. 1.Activity 915 of flow chart 900 is detailed in flow chart 1500 which isshown in FIG. 15. Once activity 915 has been completed, process controlis passed to activity 917 as indicated by process flow line 916 as shownin flow chart 900 of FIG. 9.

Activity 917 is used to add one or more aggregate or summary databasetables, such as summary database table 815 of database 800 shown in FIG.8, to the existing database, such as database 600 shown in FIG. 6.Detailed flow chart 1900 as shown in FIG. 19 details the processassociated with activity 917 shown in flow chart 900 of FIG. 9. Anynumber of summary database tables may be added to the target database.In addition, these summary database tables may be added at any timeafter unified boundary database tables have been added. Activity 917 isperformed with a CASE tool or data modeling tool and with databasemanagement system software running on the computer processor 4 shown inFIG. 1. Once the summary database tables have been added, as indicatedby process flow line 918, process control is terminated after activity917 of flow chart 900.

FIG. 10 shows detailed flow chart 1000 of the activity 903, which isdepicted in flow chart 900 shown in FIG. 9. Flow chart 1000 is comprisedof tasks 1001, 1003, 1005 and 1007, of computer data storage areas 920and 921, of data flows 1008 and 1009, and of process flow lines 1002,1004 and 1006. Activity 903 reads data from and writes data to computerdata storage area 920 as indicated by data flow line 1008. Computer datastorage area 920 may be a specific portion of computer memory 8 shown inFIG. 1 which contains the data models of the databases to be converted.In addition, task 1007 reads data from computer data storage area 921 asindicated by data flow line 1009. Computer data storage area 921 may bea specific portion of computer memory 8 shown in FIG. 1 which containsthe data models of reusable unified boundary data entities andprocedures for populating each database instantiated unified boundarydatabase table.

Detailed flow chart 1000 represents an approach to determining whereunified boundary database tables may be added to convert anindependently heterogeneous database into a standardized homogeneousdatabase. Any table in a target database may be linked to a unifiedboundary database table provided that database table contains somereference type data that may be directly related to the reference dataof a unified boundary database table.

Task 1001, which is the first task in activity 903, is labeled“Eliminate all decode data entities”. The target data model, the datamodel to be converted, such as the data model represented by ERD 500shown in FIG. 5, is retrieved from computer data storage area 920. Adecode type of data entity is very common in normalized data models.These decode data entities are most often composed from a code type ofdata attribute that is the primary key data attribute for the dataentity and from a description type of data attribute. Data entity 1401of ERD 1400 shown in FIG. 14A is an example of a decode type dataentity. Decode type data entities are an artifact of a prior art datanormalization process. The coded data attribute, such as data attribute1417 of data entity 1403, is also represented in the decode type dataentity 1401 as the code type data attribute 1409. The decode type dataentities, such as data entity 1401 of an entity-relationship diagram1400, each represent a consolidated list of codes and theirdescriptions. Since the code data attribute is redundant for ourpurposes, that is data attribute 1409 is redundant for data attribute1417 in ERD 1400, all decode type data entities need to be removed fromconsideration in the target data model. For the purposes of this patent,a decode type data entity may not be a local boundary data entity. Oncethe decode type data entities have been eliminated from consideration,process control is passed from task 1001 to task 1003 as indicated byprocess flow line 1002 of detailed flow chart 1000 shown in FIG. 10.

Task 1003, which is labeled “Find ultimate parent data entities”, is aneffort to find the highest level reference data which is referred to asthe ultimate parent data entities. When decode type data entities arenot considered, ultimate parent data entities are data entities that donot inherit foreign key data attributes from any other data entities.ERD 500 shown in FIG. 5 contains no decode data entities. ERD 500 hasdata entity 501 as an ultimate parent data entity in that data model.Data entity 501 contributes data attributes in the form of foreign keydata attributes to data entities 503 and 504. As such, data entities 503and 504 are not ultimate parent data entities as they inherit dataattributes from a different data entity which is data entity 501. WithinERD 500, the ultimate parent data entities are data entities 501, 502and 505.

In the process of converting a prior art data model into a standardizedhomogeneous data model, the unified boundary data entities oftendisplace the ultimate parent data entities and the unified boundary dataentities themselves become the ultimate parent data entities. Forexample, data entity 501 of database 700 shown in FIG. 7 was an ultimateparent data entity before unified boundary data entity 701 was added.Once unified boundary data entity 701 was added, along with data entityrelationship 706, data entity 501 is no longer an ultimate parent dataentity having been displaced by unified boundary data entity 701.

Once the ultimate parent data entities have been located by the computerprocessor 4, process control is passed to task 1005 as indicated byprocess flow line 1004 of flow chart 1000 as shown in FIG. 10. Task1005, which is labeled “Find more granular forms of the ultimate parententities”, is again a further attempt to search though computer memory 8for local database boundary related reference data. Any data entity,which has a single data entity relationship that inherits foreign keydata attributes from one and only one local database boundary dataentity, may be a local database boundary data entity. For example, ERD500 shown in FIG. 5 has three ultimate parent data entities which aredata entities 501, 502 and 505. In ERD 500, data entities 503 and 504are directly related to ultimate parent data entity 501. However, onlydata entity 503 has single data entity relationship 510 relating it toone and only one ultimate parent entity 501. Data entity 504 has dataentity relationships from both ultimate parent data entity 501 andultimate parent entity 505 and therefore is not a local databaseboundary data entity.

In ERD 500 shown in FIG. 5, the ultimate parent data entities have beenestablished as data entities 501, 502 and 505. While data entity 503 isnot an ultimate parent data entity, it represents a more granular fromof the reference data defined in ultimate parent data entity 501 andtherefore data entity 503 is a local boundary data entity.

The local boundary data entities of ERD 500, shown in FIG. 5, have beendetermined to be comprised of ultimate parent data entities 501, 502 and505 and data entity 503, where data entity 503 represents a moregranular form of ultimate parent data entity 501. Once the data modelcontaining ERD 500 is instantiated into a database, such as database 600shown in FIG. 6, the data values stored in the local boundary databasetables, such as database tables 601, 602, 605 and 603, will furtherdefine the unique database boundary. Once task 1005 of activity 903 ofdetailed flow chart 1000 shown in FIG. 10 has been completed, processflow line 1006 indicates that program control is passed to task 1007.

Task 1007 is used to determine which unified boundary data entities mustbe added to the target ERD. In order to implement a complete unifieddatabase boundary for a data model such as the data model that containsERD 500 shown in FIG. 5, each local boundary data entity needs to bedisplaced by a unified boundary data entity. However, any addition of aunified boundary data entity to an ERD will provide some addedfunctionality to the instantiated database. Therefore, the databasedesigner, using the CASE tool software executing on a computer processor4, must determine which of the local boundary data entities should bedisplaced. Once it is determined which local boundary data entities willbe displaced, task 1007 of detailed flow chart 1000 has been completed.This also completes activity 903 as depicted in detailed flow chart 1000as well as in flow chart 900 shown in FIG. 9.

FIG. 11 shows detailed flow chart 1100 that details the tasks associatedwith activity 907, which is also depicted in flow chart 900 shown inFIG. 9. Detailed flow chart 1100 shows tasks 1101, 1103, 1105, 1107,1109 and 1111 that are a part of activity 907 which is labeled “Developa unified boundary data entity”. Program control within activity 907 ismanaged by process flow lines 1102, 1104, 1106, 1108 and 1110. Activity907 both reads data from and writes data to computer data storage areas921 and 923 via data flows 1112 and 1113 respectively. Computer datastorage area 921 may be a specific portion of computer memory 8 shown inFIG. 1 which contains the data model of reusable unified boundary dataentities and procedures for populating each database instantiatedunified boundary database table. Computer data storage area 923 may be aspecific portion of computer memory 8 shown in FIG. 1 which contains thereusable unified metadata dictionary.

The unified boundary data entities could, in theory, form a closedboundary that encapsulates all other data entities. The unified boundarydata entities are independent in that they do not inherit foreign keydata attributes from other data entities except:

-   -   from another unified boundary data entity that represents a less        granular representation of the same data    -   from decode type data entities        The unified boundary data entities are designed with the        objective that they encompass the rest of the universe of data        entities. In practice, however, a combination of unified        boundary data entities and local database boundary data entities        may be used to encapsulate the remainder of data entities in a        data model. A limited set of unified boundary data entities        provide any data model with the metadata commonality required to        support data set integration across databases which is the major        objective for this work.

Task 1101 of detailed flow chart 1100 shown in FIG. 11, is labeled“Create a unique table name”. A data entity name is considered ametadata element. Unified boundary data entity metadata needs to beidentical for each standardized homogeneous database however, within asingle database, all database table names must be unique. Since theunified boundary database tables need to be incorporated into multipleindependently designed databases, and since each database table namemust be unique in each database, much consideration needs to be given tothe unified boundary database table names. The unified boundary dataentities are developed as part of an ERD that is contained withinunified boundary data model that is stored and maintained in computerdata storage area 921 via data flow 1112 as depicted in detailed flowchart 1100 shown in FIG. 11.

To begin task 1101, the CASE tool executing on computer processor 4reads the unified boundary data model from computer storage area 921,which may be part of computer memory 8, and displays the unifiedboundary ERD on computer display device 6. The unified metadatadictionary is used to develop the unified boundary data entity name andonce that name is developed, that metadata is added to unified metadatadictionary 923 via data flow 1113 using the computer processor 4 and thecomputer memory 8. Once the unified boundary data entity is uniquelynamed, program control is passed to task 1103 as indicated by processflow line 1102.

Task 1103 is labeled “Create uniquely named primary key dataattributes”. Data attribute names are considered metadata elements.Ideally, unified boundary data attributes need to be identical for eachdatabase to support the homogenous layer of these standardizedhomogeneous databases. Within a data entity, each data attribute needsto have a unique name. This includes any and all inherited foreign keydata attributes. The names of the primary key data attributes for aunified boundary data entity is very important because these primary keydata attribute names are inherited into many other data entities inmultiple databases. Unified metadata dictionary 923 is used to developthe unified boundary data entity primary key data attribute names andonce that name is developed, that metadata is added to unified metadatadictionary 923 via data flow 1113 using computer processor 4 andcomputer memory 8. Once the unified boundary data entity primary key hasbeen defined, program control is passed to task 1105 as indicated byprocess flow line 1104.

Task 1105 of detailed flow chart 1100, as shown in FIG. 11, is labeled“Define a unique business key based upon fundamental business key dataattributes”. The fundamental business key data attributes used to form aunique business key of a unified boundary data entity are extremelycritical, in at least one embodiment of the present invention, as theybecome the method for uniquely identifying each data record within theinstantiated unified boundary database table. In order for a data entityto be considered a unified boundary data entity, the unique business keymust be composed from one or more fundamental business key dataattributes.

The purpose of the unified boundary data entity, in at least oneembodiment, must be well developed before the unique business key may bedeveloped. For example, if the unified boundary data entity is designedto represent locations on Earth, a combination of the fundamentalbusiness key data attributes of latitude and longitude would be alogical start for the business key. If the unified boundary data entityis designed to represent various periods of time, then the fundamentalbusiness data attributes of date and time would be considered. The scopeof the unified boundary data entity, in at least one embodiment, mustalso be considered. The scope, as defined by the levels of data recordgranularity must be supported, in at least one embodiment. For example,if the unified boundary data entity is designed to represent timeperiods, the levels of granularity may be the calendar year, thecalendar quarter, the calendar month, the calendar week and the calendarday. The unique business key selected for the unified boundary dataentity, in at least one embodiment, must be functional for every levelof data record granularity supported. Once the fundamental business keydata attributes have been defined for the unified boundary data entity,unified metadata dictionary 923 will be updated, in at least oneembodiment. Once task 1105 of detailed flow chart 1100 shown in FIG. 11has been completed, program control is transferred to task 1107 asindicated by process flow line 1106.

Within task 1107, of detailed flow chart 1100 shown in FIG. 11, thefunctional requirements of the unified boundary data entity aredetermined. For example, most unified boundary data entities willsupport several levels of data granularity. Other unified boundary dataentities need to support recording chronological changes in the unifiedboundary data records. Some unified boundary data entities, in at leastone embodiment, will need to support the combination or merging ofmultiple data records into a single data record or need to support asingle data record splitting into multiple data records all as afunction of time. Each functional requirement will have a set of dataattributes that need to be added to the unified boundary data entity tosupport that functional requirement. In some cases, some of theseadditional data attributes need to be added to the unique business keyof the unified boundary data entity. For example, to support therecording of chronological changes in a unified boundary data entity,the data attributes of “effective date” and “expiration date”, in atleast one embodiment, must be added to the unified boundary data entity.The “effective date” data attributes now needs to be added to the uniquebusiness key data attributes to support the unique identification of adata record at a specific point in time. Once all of the data attributesneeded to support required functionality have been added to the unifiedboundary data entity, unified metadata dictionary 923 is updated viadata flow 1113. This completes task 1107 of detailed flow chart 1100shown in FIG. 11, and process control will be passed from task 1107 totask 1109 as indicated by process flow line 1108.

In task 1109 of detailed flow chart 1100 shown in FIG. 11, additionaldata attributes may be added to the unified boundary data entity thatrepresent additional useful data that is often used to further definethe reference data record. Unified metadata dictionary 923 is used todefine the metadata associated with any new data attributes. Once theseadditional data attributes have been added to the unified boundary dataentity, unified metadata dictionary 923 is updated and the completedunified boundary data entity is stored in unified boundary data model921. This completes task 1109 and program control is passed to task 1111as indicated by process flow line 1110.

Task 1111 is used to develop a procedure to populate a specific unifiedboundary database table with a consistent set of unified boundaryreference data records. Each specific unified boundary data entity willresult in a single specific unified boundary database table in eachstandardized homogenous database where that specific unified boundarydatabase table is required. Each of the specific unified boundarydatabase tables, one of each in each standardized homogeneous database,will each require, in at least one embodiment, a consistent set ofunified boundary reference data records. These consistent sets ofunified boundary specific reference data records will ensure referentialintegrity between databases for each specific unified boundary databasetable. This inter-database referential integrity is required, in atleast one embodiment, to support the formation of database bridges thatform database access paths between databases.

Each procedure to populate a set of specific unified boundary databasetables will be developed using prior art methods to populate databasetables. Each procedure will include SQL scripts and may include otherprior art components such as XML, program code, and writteninstructions. In any event, once the procedure for populating theunified boundary database tables has been completed, the procedure willbe stored in unified boundary data model computer storage area 921. Task1111 of detailed flow chart 1100 is complete as well as activity 907 offlow chart 900 shown in FIG. 9. Program control will now be transferredto activity 910 via process flow lines 908 and 909 as depicted in flowchart 900 of FIG. 9.

FIG. 12 shows ERD 1200 with unified boundary data entity 1201. Thepurpose of unified boundary data entity 1201 is to define various timeperiods associated with the Gregorian calendar such as the calendaryears, the calendar months, and the calendar day. Unified boundary dataentity 1201 was developed following the detailed flow chart 1100 asshown in FIG. 11. Task 1101 of detailed flow chart 1100 addresses thenaming of unified boundary data entities. The unified boundary dataentity name 1202 is “MK Time Period” as shown in ERD 1200 of FIG. 12.This data entity name is selected to be both informative as to thecontent of the data entity and unique within any set of data entitiesfor any data model. The “Time Period” portion of unified boundary dataentity name is somewhat unique and describes the data domain to theunified boundary data entity. The “MK” portion of the unified boundarydata entity name 1202 was added merely to help assure uniqueness of thedata entity name.

The unique naming of unified boundary data entities primary keyattributes, such as primary key attribute 1203 of unified boundary dataentity 1201 shown in FIG. 12, is addressed by task 1103 of activity 907as depicted in flow chart 1100 of FIG. 11. Unified boundary data entity1201 contains a single primary key data attribute 1203 as denoted by the“(PK)” designation. Data attribute name 1203 for this primary key dataattribute is “MK Time Period ID”. Since this primary key data attributemay be inherited into many other data entities via data entityrelationship inheritance, the primary key data attribute names needs tobe both informative and unique. The “MK Time Period” portion of dataattribute name 1203 is indicative that this data attribute originated inthe “MK Time Period” unified boundary data entity 1201. The “ID” portionof data attribute name 1203 is indicative that this data attribute is asurrogate primary key type of data attribute. The name of data attribute1203 is therefore unique to the uniquely named unified boundary dataentity 1201 and should be unique anyway this primary key data attributewould be inherited.

The design of the unique business key for a unified boundary data entity1201 of ERD 1200 is addressed, by a computer processor, such as computerprocessor 4, as programmed by computer software stored in computermemory 8, in task 1105 of activity 907 as depicted in detailed flowchart 1100 for FIG. 11. For unified boundary data entity 1201 of ERD1200, the unique business key is composed of fundamental business keydata attributes 1205 and 1206 named “MK Time Period Start” and “MK TimePeriod End” respectively and designated “(AK1)” and “(AK2)”respectively. The “(AK)” designation is indicative of an alternate key.In this case the alternate key is composed of two business dataattributes that combine to uniquely identify all data records that maybe stored in the instantiated database table in computer memory 8.

These business key data attributes 1205 and 1206 are both based upon thefundamental measure of date and time. Time and date is globally definedand its unique identification is not dependent of any other dataattributes. Time and date represents a singularly defined data standardand it may be resolved to a very low level of granularity down ofsub-second measurement. Therefore, business data attributes 1205 and1206 are fundamental business key data attributes. Each time period thatis defined within data entity 1201 will be identified by its compositealternate key based upon the start of time period data value stored bydata attribute 1205 and upon the end of time period data value stored bydata attribute 1206. The fact that data entity 1201 has a uniquebusiness key based entirely upon fundamental data attributes insuresthat data entity 1201 is boundary data entity for any data model. Inaddition, the metadata for data entity 1201 is designed to be useable inmultiple databases. Therefore, data entity 1201 is designed to beunified boundary data entity.

The alternate key, of unified boundary data entity 1201, enforces theuniqueness of the data records to be stored in its instantiated databasetable, in computer memory 8. In at least one embodiment, the computerprocessor 4 is programmed by computer software to not allow any two datarecords to contain equal start time period data values for dataattribute 1205 as well as equal end time period data values for dataattribute 1206. In fact, any two data records with the same dataattribute 1205 data values as well as the same data attribute 1205 datavalues will represent exactly the same time period and are thereforeredundant data records. The computer processor 4 is programmed to notallow redundant data records for the unified boundary database table,stored in computer memory 8, instantiated from data entity 1201, as thedatabase management system, in the computer processor 4 is programmed bycomputer software to enforce the unique database table indexinstantiated to maintain the data integrity of the alternate key.

The computer processor 4 is programmed by computer software to add dataattributes to unified boundary data entities that support requiredfunctionality as addressed in task 1107 of activity 907 as depicted indetailed flow chart 1100. Task 1107, as executed by the computerprocessor 4, addresses the addition of data attributes to support therequired functionality of the unified boundary data entity. For ERD1200, shown in FIG. 12, unified boundary data entity 1201 is designed tosupport multiple levels of granularity of the reference data. Thissupport for multiple levels of data granularity will allow for addingsummary data into the instantiated database, stored in the computermemory 8, and thus promotes data warehouse type data functionalitywithin the instantiated database. The computer processor 4 is programmedby computer software to add data attribute 1204 with a data attributename of “MK Time Period Type” to unified boundary data entity 1201specifically to classify each level of granularity type within theunified boundary data entity. The computer processor 4 is programmed toadd data attributes 1207, 1208, 1209, 1210 and 1211 to represent thecalendar year, the calendar quarter, the calendar month, the calendarweek and the calendar date levels of granularity respectively.

The computer processor 4 is programmed by computer software to add dataattribute 1212, of ERD 1200 shown in FIG. 12, to unified boundary dataentity 1201 via task 1109 of activity 907 as depicted in flow chart 1100of FIG. 11. Task 1109, as executed by the computer processor 4,addresses the addition of other useful data attributes, such as dataattribute 1212, to a unified boundary data entity, such as data entity1201. Data attribute 1212 is named “MK Week Day Name” and will have datavalues of “Monday”, “Tuesday”, “Wednesday”, “Thursday”, “Friday”,“Saturday”, and “Sunday”. The date level of granularity is alreadyrepresented in unified boundary data entity 1201 with data attribute1211. Data attribute 1212 is simply used as additional usefulinformation about a calendar date. Once the additional data attributeshave been added to the unified boundary data entity, in computer memory8, by the computer processor 4, that unified boundary data entity iscomplete, in at least one embodiment. Finally, a reusable unifiedboundary data population procedure is developed in task 1111 of detailedflow chart 1100 shown in FIG. 11. This unified boundary data populationprocedure is specific for each unified boundary database table andincludes software used to populate each of the specific unified boundarydatabase tables with data records in each and every database into whichthat specific unified boundary database table is instantiated.

Unified boundary data entities and preparing unified boundary dataentities in computer memory by use of a computer processor programmed bycomputer software, are not a part of prior art knowledge. First, unifiedboundary data entities are boundary data entities since they representthe outer most boundary of any data model. The concept of an outerboundary for any data model, stored in computer memory, is not prior artknowledge. Likewise, unified boundary database tables represent theouter most boundary of any database, stored in computer memory. Theconcept of an outer boundary of any database is not prior art knowledge.Secondly, unified boundary data entities are unified in that they areused as a set of standard metadata in boundary data entities for two ormore independent heterogeneous data models, in computer memory.Converting multiple data models into standardized homogeneous datamodels by addition of unified boundary data entities, or implementingthis through a computer processor programmed by computer software, isnot a part of prior art knowledge. Likewise, unified boundary databasetables are unified because they are to be used as a set of standardmetadata and a set of standard data records used to convert multipleheterogeneous databases into standardized homogeneous databases. Again,the conversion of multiple databases into standardized homogeneousdatabases by adding unified boundary database tables is not a part ofprior art knowledge.

FIG. 13 shows detailed flow chart 1300 of activity 910, which can beexecuted by the computer processor 4 programmed by computer softwarestored in computer memory 8. Activity 910 is also shown in master flowchart 900 shown in FIG. 9. Detailed flow chart 1300 shows a method whichcan be implemented by the computer processor 4 programmed by computersoftware stored in computer memory 8 to incorporate unified boundarydata entities stored in the computer memory 8, such as unified boundarydata entity 1201 depicted in ERD 1200 shown in FIG. 12, into a targetdata model in computer memory 8. This is a part of an overall process ofconverting a database in computer memory 8, such as database 600 shownin FIG. 6, into a standardized homogenous database such as database 800in computer memory 8, shown in FIG. 8. Detailed flow chart 1300 shown inFIG. 13 depicts tasks 1301, 1303, and 1305, process flow lines 1302 and1304, computer data storage areas 920 and 921, and data flow lines 1306and 1307. Computer data storage area 920 may be a specific portion ofcomputer memory 8 shown in FIG. 1 which contains the target data modelthat is to be converted into a standardized homogeneous data model.Computer data storage area 921 may be a specific portion of computermemory 8 shown in FIG. 1 which contains the data model of reusableunified boundary data entities and procedures for populating eachdatabase instantiated unified boundary database table.

In the first task, task 1301 of detailed flow chart 1300 shown in FIG.13, the computer processor 4 is programmed by computer software to addan appropriate reusable unified boundary data entity to the target datamodel in computer memory 8. First the target data model is retrievedfrom computer data storage area 920 via data flow 1307. The unifiedboundary data entities to be added to the target data model areretrieved from computer data storage area 921 via data flow 1306.Depending upon the CASE tool used by the computer processor 4, and thedata model functions supported by the CASE tool software application,the selected unified boundary data entity may be copied or may beinherited into the target data model. The result is that the target datamodel will now contain a copy of the unified boundary data entity inaddition to the previously existing data entities. Once this task iscompleted, the computer processor 4, as represented by process flow line1302 of detailed flow chart 1300, transfers program control from task1301 to task 1303.

The computer processor 4 as programmed by computer software, executestask 1303, of detailed flow chart 1300 shown in FIG. 13, to create oneor more data entity relationships in computer memory 8, such as datarelationship 706 of ERD 700 shown in FIG. 7, originating from theunified boundary data entity, such as unified boundary data entity 701shown in FIG. 7, and terminating in the appropriate target dataentities, such as data entity 501 shown in FIG. 7. The unified boundarydata entity will now become a boundary data entity for the target datamodel. By adding the proper data entity relationship from a unifiedboundary data entity to a target data entity, the target data entity nowinherits foreign key data attributes from the unified boundary dataentity. With the completion of task 1303, as indicated by process flowline 1304 of detailed flow chart 1300, the computer processor 4 isprogrammed by computer software to transfer process control to task1305.

Task 1305 of detailed flow chart 1300 shown in FIG. 13 is the last taskin activity 910. When the foreign key data attributes that are inheritedfrom a unified boundary data entity, these foreign key data attributesneed to be declared, by the computer processor 4 executing computersoftware, as optional data attributes. When these foreign key attributesare instantiated into a database populate with data records by thecomputer processor 4, the resulting database columns will need to beempty, in at least one embodiment, for each data record. This is only aconsideration when unified boundary database tables and their associatedforeign key constraints are added to an already populated database.Later, after the unified boundary database tables are populated and whenthe foreign key database columns are populated, the optionality(optional or mandatory) of the foreign key database columns may beadjusted by the computer processor 4 as programmed by computer software,depending upon the strategy used for maintaining the data values inthese foreign key database columns. Once all of the foreign key dataattributes inherited from unified boundary data entities have beendeclared as optional by the computer processor 4, the target data model,in at least one embodiment, needs to be updated by the computerprocessor 4 in the computer data storage area 920 via data flow 1307.This concludes task 1305 and activity 910 of detailed flow chart 1300.Process control, as executed by the computer processor 4, is nowtransferred from activity 910 to decision 912 via process flow line 911of master flow chart 900 shown in FIG. 9.

FIG. 14A shows ERD 1400 contained within an independently designedheterogeneous data model, which would be stored in computer memory, suchas computer memory 8. In ERD 1400, data entities 1401, 1402 and 1403 aswell as data entity relationships 1404 and 1405 represent an ERD of atarget independent heterogeneous data model to be converted into astandardized homogeneous data model, by the computer processor 4 asprogrammed by computer software and stored in computer memory 8. Thistarget ERD 1400 is stored in its data model in computer data storagearea 920 as seen in detailed flow chart 1300 shown in FIG. 13.

Data entity 1401 is an example of a decode type data entity, which hasdata entity name 1406 (Transaction Type). A decode type of data entityis a data entity that contains a code-type data attribute, such as dataattribute 1409, that is declared as the primary key of the decode dataentity. The declared primary key data attribute receives the (PK)notation and is displayed above the line, such as line 202 a of ERD 200,within its data entity, such as data entity 202 shown in FIG. 2. Inaddition, a decode data entity contains a description-type dataattribute, such as data attribute 1410, in computer memory 8, that hastextual data values used to describe the code-type data attribute's datavalue, such as code-type data attribute 1409. For example data attribute1409 could have a data value of “EFT” and data attribute 1410 could havea data value of “Electronic Funds Transfer” contained in the same datarecord. The purpose of data entity 1401, once instantiated into adatabase, is to store a list of data records where each data recordcontains a transaction type code data value and of a transaction codedescription data value.

Data entity 1402, which has data entity name 1408 (Account), is a dataentity used to record data values associated with individual accounts.Data entity 1402 will provides a list of unique account numbers asreference data within the instantiated database. Data attribute 1411,which is used to store unique account numbers, is declared to be theprimary key for data entity 1402. Data attribute 1412 represents thedate that the account was opened while data attribute 1413 represents anindicator as to whether the account is active or inactive.

Data entity 1403, which has data entity name 1407 (Transaction), is adata entity used to record account transaction details. Primary key dataattribute 1414, which is named Transaction ID, is the primary surrogatekey for data entity 1403. Data attribute 1415 represents the date thatthe transaction data record was booked. Data attribute 1416, which isdenoted as the first foreign key data attribute “(FK1)”, represents theaccount number that is impacted by the transaction. Data attribute 1416is inherited from data attribute 1411 of data entity 1403 via dataentity relationship 1405. Data attribute 1417, which is denoted as thesecond foreign key data attribute “(FK2)”, represents the transactiontype of each transaction. Data attribute 1417 is inherited from dataattribute 1409 of data entity 1401 via data entity relationship 1404.Data attribute 1418 is used to store a check number for transactionswhere checks are used. Data attribute 1418 would be considered anoptional data attribute because a data value is not required to completea transaction database table's data record. Data attribute 1419 is usedto store a detailed description for the transaction and data attribute1420 is used to store the US dollar amount of the transaction. The datamodel that contains ERD 1400 is merely for example purposes and is notintended to be a complete and properly normalized data model. This datamodel is also independently designed and heterogeneous as it has nodeliberate metadata commonality to any other data model.

FIG. 14B depicts ERD 1400 a, which shows the result of the computerprocessor 4 adding unified boundary data entity 1201 to ERD 1400 shownin FIG. 14A. Unified boundary data entity 1201 of ERD 1400 a is the sameunified boundary data entity as data entity 1201 of ERD 1200 shown inFIG. 12. Unified boundary data entity 1201 is a unified boundary dataentity that was developed by the computer processor 4, as set forth indetailed flow chart 1100 shown in FIG. 11 and stored in computer datastorage area 921 in computer memory 8, also shown in detailed flow chart1100. The addition of unified boundary entity 1201 to ERD 1400 wasachieved, by the computer processor 4 as programmed by computersoftware, using activity 910 shown in detailed flow chart 1300 asdepicted in FIG. 13. Data entities 1401 and 1402 of ERD 1400 a are thesame data entities as data entities 1401 and 1402 respectively of ERD1400, stored in computer memory 8, shown in FIG. 14A. Data entity 1403 aof ERD 1400 a began as data entity 1403 of ERD 1400. The computerprocessor 4 is programmed by computer software to use data entityrelationship 1422 to cause foreign key data attribute 1421 to beinherited into data entity 1403 a from primary key data attribute 1203of unified boundary data entity 1201.

In ERD 1400 shown in FIG. 14A, data attribute 1415 of data entity 1403represented a fundamental measure as it relates to the measure of time.The addition of unified boundary data entity 1201 provides additionalmaster data functionality to the target data model design, stored incomputer memory 8. Before the unified boundary data entity 1201 wasadded by the computer processor 4, the transactional data, such as dataattribute 1420 of data entity 1403, was only represented at the daylevel of granularity in ERD 1400, shown in FIG. 14A. With the variety ofgranularity levels provided by unified boundary data entity 1201, now,the same transactional data may be aggregated into weekly amounts,monthly amounts, quarterly amounts or yearly amounts for example asdepicted in ERD 1400 a shown in FIG. 14B. This ability to aggregate datais characteristic of a data warehouse type of data model design. Theunified database boundary is extremely important, in at least oneembodiment of the present invention, for adding functionality to anytarget independent heterogeneous data model, stored in computer memory.

The addition of unified boundary data entity 1201 to ERD 1400 a, by thecomputer processor 4 as programmed by computer software, shown in FIG.14B converts an independently designed heterogeneous ERD into astandardized homogeneous ERD. While only a small portion of the ERD wasmodified, it was a very significant modification. All data attributeswithin the ERD are now directly or indirectly related to this unifiedboundary data entity, in computer memory 8. Therefore, every data entityin ERD 1400 a, in at least one embodiment, is now defined, in computermemory 8, in a homogeneous manner relative to unified boundary dataentity 1201. When ERDs from multiple data models contain unifiedboundary data entity 1201, the homogeneous boundary data entity providesa basis for the integration of metadata from these multiple data models.

FIG. 15 shows a detailed flow chart 1500 that details activity 915.Activity 915, shown in FIG. 15, is the same activity 915 in master flowchart 900 shown in FIG. 9. Activity 915 is the database instantiation ofthe standardized homogeneous data model, such as the data model thatcontains ERD 700 shown in FIG. 7. The result of activity 915, asexecuted by the computer processor 4 programmed by computer softwarestored in computer memory 8, will be the conversion of the existingtarget database, such as database 600 shown in FIG. 6, into astandardized homogeneous database such as database 800 shown in FIG. 8,in the computer memory 8.

Detailed flow chart 1500 depicts tasks 1501, 1503, 1505 and 1507 all aspart of activity 915, to be executed by computer processor 4 asprogrammed by computer software stored in computer memory 8. Processcontrol in detailed flow chart 1500 is depicted by process flow lines1502, 1504 and 1506. Computer data storage areas 920, 921 and 922 alongwith their data flows 1508, 1509 and 1510 respectively are also depictedin detailed flow chart 1500. Computer data storage area 920 may be aspecific portion of computer memory 8 shown in FIG. 1 which contains thetarget data model that is to be converted into a standardizedhomogeneous data model. Computer data storage area 921 may be a specificportion of computer memory 8 shown in FIG. 1 which contains the datamodel of reusable unified boundary data entities and procedures forpopulating each database instantiated unified boundary database table.Computer data storage area 922 may be a specific portion of computermemory 8 shown in FIG. 1 which contains the target database that is tobe converted into a standardized homogeneous database.

Activity 915 of detailed flow chart 1500 begins with task 1501. Task1501 is the database instantiation of a standardized homogeneous datamodel, such as the data model that contains ERD 700 shown in FIG. 7,into the existing target database such as database 600 shown in FIG. 6.The result of activity 915, as executed by the computer processor 4, asprogrammed by computer software, will be a standardized homogeneousdatabase such as standardized homogeneous database 800 shown in FIG. 8.First, in task 1501, the target data model, which has now been updatedto a standardized homogeneous data model, is retrieved from the computerdata storage area 920, in computer memory 8, by the computer processor 4as indicated by data flow 1508. Then, a Standard Query Language (SQL)data definition language script is computer generated by the datamodeling tool stored in computer memory 8 and as implemented by thecomputer processor 4, from the target standardized homogeneous datamodel. This SQL script contains the instructions for the databasemanagement system (DBMS) software application running on the computerprocessor 4, to instantiate the unified boundary database tables in thecomputer memory 8 and to instantiate their foreign key constraints inthe computer memory 8. Once this SQL script is executed by the computerprocessor 4, the existing target database will be converted into astandardized homogeneous database in the DBMS and stored in computerdata storage area 922 in the computer memory 8 by the computer processor4 as indicated by data flow 1510. The database instantiation of aconverted data model's unified boundary data entities, such as unifiedboundary data entities 701 and 702 of ERD 700 shown in FIG. 7, resultsin unified boundary database tables in the computer memory 8, such asunified boundary database tables 801 and 802 respectively of database800 shown in FIG. 8. The database instantiation of the data model'sunified boundary data entity relationships, such as data entityrelationships 706 and 708 of ERD 700, results in unified boundarydatabase table related foreign key constraints such as foreign keyconstraint 806 and 808 respectively of database 800 shown in FIG. 8.Once the unified boundary data entities and their foreign keyconstraints are instantiated by the computer processor 4, task 1501 ofdetailed flow chart 1500 shown in FIG. 15 has been completed. Processcontrol is then passed from task 1501 to task 1503, by the computerprocessor 4, as indicated by process flow line 1502 of detailed flowchart 1500.

The computer processor 4 is programmed by computer software to implementtask 1503 to populate the database instantiated unified boundarydatabase tables in the computer memory 8, with standardized homogeneousreference data records needed to enrich the reference data of the targetdatabase. The SQL script for populating each unified boundary databasetable, such as unified boundary database table 801 of database 800 shownin FIG. 8, with unified boundary data records, in at least oneembodiment, should be programmed after the unified boundary data entityhas been designed. Just as the unified boundary database table arereusable for any standardized homogeneous database; its associated SQLscript for populating that reusable unified boundary database table isalso reusable for any standardized homogeneous database.

The computer processor 4 is programmed by computer software to begin thetask 1503 of detailed flow chart 1500, shown in FIG. 15, by retrievingthe SQL script for populating the specific unified boundary databasetable from the computer data storage area 921, in computer memory 8, asindicated by data flow line 1509. The unified procedure for populatingthe unified boundary database table is executed by the computerprocessor 4 as programmed by computer software stored in the computermemory 8, and the unified boundary database table will now be completelypopulated, in at least one embodiment. The unified boundary data recordsare stored in their unified boundary database tables within computerdata storage area 922, in computer memory 8. by the computer processor 4as indicated by data flow 1510 as shown in FIG. 15. The computerprocessor 4 is programmed to implement task 1503 for each of the unifiedboundary database tables until each one is completely populated incomputer memory 8. Once all of the unified boundary database tables havebeen completely populated with data records, task 1503 is completed.Process control for computer processor 4 is then passed from task 1503to task 1505 as indicated by process flow line 1504 of detailed flowchart 1500 shown in FIG. 15.

Task 1505 of detailed flow chart 1500, shown in FIG. 15, involves thedevelopment of a specialized SQL procedure, programmed on a computerprocessor, such as computer processor 4, to populate foreign keydatabase columns in the computer memory 8, that have been added toexisting database tables by the instantiation of unified boundarydatabase tables and their foreign key constraints. Each specialized SQLprocedure is unique for each target database table since the targetdatabase tables themselves are each heterogeneous and are thus unique.Once the specialized SQL procedure to populate the foreign key datadatabase columns has been created by the computer processor 4 asprogrammed by computer software, the method may be stored in computerdata storage area 920 of computer memory 8 as indicated by data flow1508 of detailed flow chart 1500 shown in FIG. 15. Once all thespecialized SQL procedures have been created by the computer processor 4and stored in computer memory 8, task 1505 is complete and processcontrol is passed from task 1505 to task 1507 as indicated by processflow line 1506.

The computer processor 4 implements task 1507 to populate the inheritedforeign key data attributes with the proper data values to complete theforeign key relation between the unified boundary database tables andthe remainder of the target database tables, in computer memory 8. Thespecific SQL procedures developed by the computer processor 4 and storedin computer memory 8 in task 1505 are retrieved from computer datastorage area 920 by the computer processor 4 as indicated by data flow1508 of detailed flow chart 1500 shown in FIG. 15. The specific SQLprocedure, once executed by the computer processor 4, will populate theforeign key database columns in computer data storage area 922, incomputer memory 8, as indicated by data flow 1510 shown in FIG. 15. Onceall of the foreign key database columns have been populated by thecomputer processor 4, task 1507 is complete as is activity 915 ofdetailed flow chart 1500 shown in FIG. 15.

FIG. 16 represents a database 1600, that can be stored in computermemory 8, and that contains a populated unified boundary database table1601. This populated unified boundary database table 1601 represents thedatabase instantiation of unified boundary data entity 1201 of ERD 1200as shown in FIG. 12. Database table name 1602, shown in FIG. 16, wasinstantiated, by the computer processor 4 as programmed by computersoftware, from data entity name 1202 as shown in FIG. 12. The unifiedboundary database columns 1603, 1604, 1605, 1606, 1607, 1608, 1609,1610, 1611 and 1612 are instantiated by the computer processor 4 intothe database table 1601 based upon unified boundary data attributes1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211 and 1212respectively of data entity 1201 depicted in ERD 1200 shown in FIG. 12.

When first instantiated into a database, unified boundary databasetables, such as unified boundary database table 1601, are empty in thatthe database table contains no data records. This database instantiationof empty unified boundary database table 1601 in to a database isperformed by the computer processor 4 with task 1501 of detailed flowchart 1500 shown in FIG. 15. Unified boundary database table 1601 ispopulated in computer memory 8 as detailed in task 1503 of detailed flowchart 1500. Specifically, a predefined SQL script as stored in computermemory 8 is normally employed and/or executed by the computer processor4 to populate unified boundary database table 1601 in the computermemory 8 within any standardized homogeneous database.

Unified boundary database table 1601 has database column 1603 as theprimary key for this database table. As such, a unique index isinstantiated into the database that references database column 1603 andthat enforces the uniqueness of the data values in that database column.In other words, no two data records in database table 1601 will beallowed to have the same data value in database column 1603.Additionally, a unique database index that references the alternate keydatabase columns 1605 and 1606 is also instantiated into the database.This unique index is a composite index that enforces the uniqueness ofthe combined data values from database columns 1605 and 1606. Therefore,in at least one embodiment, no two data records in database table 1601may have the same pair of data values in columns 1605 and 1606. Databasecolumns 1605 and 1606 are instantiated by the computer processor 4 fromfundamental business key data attributes. As such, database columns 1605and 1606 ensure that this database table is a boundary database tablethat is extremely important, in at least one embodiment, as a commonbasis used to define the significance of much of the data in thedatabase.

The data records shown in database table 1601 of FIG. 16, such as datarecords 1613, 1614, 1615, 1616, 1617, 1618, 1619, 1620, 1621, 1622, 1623and 1624, are merely a sample of the entire data set. Data record 1613is an example of a data record that represents a single year in time,specifically the year 2000. Data record 1614 is an example of a datarecord that represents a single calendar quarter of year 2000,specifically the first calendar quarter of year 2000. Data record 1615is an example of a data record that represents a single calendar monthof year 2000, specifically the first month of year 2000 or January 2000.Data record 1616 is an example of a data record that represents a singlecalendar week of year 2000, specifically the first week of year 2000.Data record 1620 is an example of a data record that represents a singlecalendar date of year 2000, specifically the first day of year 2000 orSaturday Jan. 1, 2000.

Unified boundary database table 1601 of database 1600, shown in FIG. 16,was instantiated by the computer processor 4 as programmed by computersoftware from unified boundary data entity 1201 shown in FIG. 12.Unified boundary data entity 1201 was designed to support various levelsof data granularity during task 1107 of detailed flow chart 1100 shownin FIG. 11. Data attribute 1204 of data entity 1201 shown in FIG. 12 wasadded by the computer processor 4 to identify the level of datagranularity of the data record. Data attribute 1204 was instantiatedinto unified boundary database table 1601 as column 1604 as depicted indatabase 1600 shown in FIG. 16. The domain of data values for databasetable 1601 column 1604 are “Year”, “Quarter”, “Month”, “Week”, and “Day”as shown, for example, in data records 1613, 1614, 1615, 1616 and 1620respectively. Since this unified boundary database table supportsmultiple levels of reference data granularity, this database table maybe used as a dimensional table in a data warehouse type application.Data that is stored in a database at the “Month” level of granularitymay be aggregated to a higher level of granularity such as to the“Quarter” level of granularity or to the “Year” level of granularity.For example, data record 1615 of database table 1601 is a “Month” levelof granularity data record as indicated by data value of database column1604 for data record 1615. However, database column 1608 of data record1615 with a data value of “2000Q1”, indicates that data record 1615 isalso assigned to the first quarter of the year 2000. Therefore, anydatabase table data records with a foreign key constraint thatreferences data record 1615 would be associated to the first month ofthe year 2000 as well as to the first quarter of year 2000. Likewise,data that is stored at the “Month” level of granularity may be allocatedto a lower level of granularity such as to a “Week” or to a “Day”. Forexample, to allocate target data from the month level of granularity tothe week level of granularity, any data record in database table 1601that has a data value equal to “2000M01” in database column 1609, and adata value of “Week” in database column 1604, such as data records 1616,1617, 1618 and 1619, would be allocated a prorated portion of the targetdata.

Unified boundary database table 1601 is a database table that would beadded to many databases and the combination of its metadata and of itsdata records represent, in part, the standardized homogeneous layer ofeach standardized homogeneous database. Any database that containsunified boundary database table 1601 now has a database bridge thatallows combining the network of database access paths from one databaseto another based upon the common unified boundary database tables.

FIG. 17A depicts database 1700 contains database table 1701 which is thedatabase instantiation of data entity 1403 shown in ERD 1400 of FIG.14A. Database table name 1702 show in FIG. 17A is the result of thecomputer processor 4 instantiating data entity name 1407 which is shownin FIG. 14A. Database columns 1703, 1704, 1705, 1706, 1707, 1708 and1709 are the result of database instantiation by the computer processor4 of data attributes 1414, 1415, 1416, 1417, 1418, 1419 and 1420respectively of data entity 1403 of data model 1400 as shown in FIG.14A. In addition, database table 1701 is populated by the computerprocessor 4 as programmed by computer software with several transactiondata records such as data records 1711, 1712, 1713, and 1714.

The data model that contains ERD 1400, shown in FIG. 14A, has beenconverted into a standardized homogeneous data model that containsmodified ERD 1400 a as shown in FIG. 14B. In the process of convertingdata entity 1403 of ERD 1400 into modified data entity 1403 a of ERD1400 a, foreign key data attribute 1421 has been added to data entity1403 a by the computer processor 4 as programmed by computer software.Foreign key data attribute 1421 results from data entity relationship1422 which was added to relate unified boundary data entity 1201 to dataentity 1403 a.

FIG. 17B depicts database 1700 a that contains database table 1701 a,unified boundary database table 1601 and foreign key constraint 1715.Database table 1701 a was modified from database instantiated of dataentity 1403 a shown in data model 1400 a of FIG. 14B. Database columns1703, 1704, 1705, 1706, 1707, 1708, and 1709 of database table 1701 aare the same database columns as shown in database table 1701 ofdatabase 1700 as shown in FIG. 17A. The modification to table 1701 ofdatabase 1700 was the addition of database column 1710 that is shown indatabase table 1701 a. The additional database column 1710 was databaseinstantiated by the computer processor 4 as programmed by computersoftware from data entity 1403 a of ERD 1400 a shown in FIG. 14B. Indatabase 1700 a, database table 1701 a is populated by the computerprocessor 4 with data records such as data records 1711, 1712, 1713, and1714.

Database table 1601 for database 1700 a, shown in FIG. 17B, is a copy ofdatabase table 1601 from database 1600 as shown in FIG. 16. However, indatabase table 1601 of database 1700 a, only the pertinent subset ofdata records is displayed.

Foreign key constraint 1715 of database 1600 a shown in FIG. 17B,declares that database column 1710 of database table 1701 a referencesdatabase column 1603 of database table 1601. Upon creation of a datarecord in dependent database table 1701 a in computer memory 8, the datavalue of database column 1710 must exist in database column 1603 ofparent database table 1601, in computer memory 8. Data records 1711,1712, 1713 and 1714 have data values of “16”, “17”, “18” and “19”respectively in database column 1710. These data values of “16”, “17”,“18” and “19” do indeed exist in database column 1603 of database table1601 in data records 1621, 1622, 1623 and 1624 respectively. If anattempt is made to combine data records from database table 1601 withdata records from database table 1701 a, the database access path forcombining these two different data record sets is maintained by the useof foreign key constraint 1715 by the computer processor 4 as programmedby computer software. For example, data record 1711 of database table1701 a which has a data value of “16” in database column 1710 would becombined, by the computer processor 4, with data record 1621 fromdatabase table 1601 which also has the data value of “16” in databasecolumn 1603.

Before activity 915 of detailed flow chart 1500 shown in FIG. 15 hasbeen performed by the computer processor 4, database table 1701 existedas shown in database 1700 of FIG. 17A. Once activity 915 of detailedflow chart 1500 has been completed by the computer processor 4, theresult is shown in database 1700 a of FIG. 17B. Task 1501, of detailedflow chart 1500, is used, by the computer processor 4 as programmed bycomputer software, to add database table 1601, add database column 1710to database table 1701 and add foreign key constraint 1715 to database1700. Task 1503 of detailed flow chart 1500 was used to populate unifiedboundary database table 1601 with data records such as data record 1621.Once unified boundary database table 1601 is populated, the computerprocessor 4 performs tasks 1505 and 1507 to populate the data values ofdatabase column 1710 in database table 1701 a of database 1700 a. Theresult of converting database 1700 in part to a standardized homogeneousdatabase is shown in database 1700 a of FIG. 17B.

By adding the unified boundary database table to an existing database,additional database functionality is provided. First, the unifiedboundary database table enriches the existing reference data as itnormally adds more information than what originally existed. Secondly,the database's unique local boundary is displaced by a standardhomogeneous boundary that is intended to be permanent and may not bedisplaced. Thirdly, the unified boundary database table provides a basisof the homogeneous database layer. Additionally, the unified boundarydatabase table adds data warehouse functionality to the database.

FIG. 18 depicts flow chart 1800 that details a procedure to be executedby the computer processor 4 as programmed by computer software forpopulating foreign key database column 1710 of database table 1701 ashown in FIG. 17B. This procedure for populating foreign key databasecolumn 1710 is in response to task 1505 of detailed flow chart 1500shown in FIG. 15. This foreign key population flow chart is comprised ofdecision 1803, of tasks 1805, 1807 and 1809, of process flow lines 1802,1804, 1806, 1808, 1810, and 1811, of computer data storage area 922, ofdata flow lines 1810, 1811 and 1812, and of flow chart terminators 1801and 1812. Computer data storage area 922 may be a specific portion ofcomputer memory 8 shown in FIG. 1 which contains the target databasethat is to be converted into a standardized homogeneous database.

When database table 1701 a is first database instantiated by computerprocessor 4 as programmed by computer software stored in computer memory8, all data records will have a null value in database column 1710.Decision 1803 is used by computer processor 4 to determine when all datarecords of database table 1701 a have database column 1710 populated.Task 1805 is use to retrieve a single data record from database table1701 a where the data value of database column 1710 is null. Task 1807is used to find the single data record from database table 1601 wherethe data value of database column 1604 is “Day”, the day level ofgranularity, and where the data value of database column 1605 is equalto the data value of database column 1704 for the data record retrievedfrom database table 1701 a. For example, data record 1711 of databasetable 1701 a has a data value of “3 Jan. 2000” in database column 1704.In database table 1601, data record 1621 is the single data record wherethe data value of database column 1605 is also “3 Jan. 2000” and thedata value of database column 1604 is “Day”. The computer processor 4 isprogrammed by computer software to execute task 1809 to update databasecolumn 1710 of database table 1701 a. Once the single data record indatabase table 1601 has been located, such as data record 1621, the datavalue in database column 1603 (“16”) of database table 1601 is insertedinto data record 1711 database column 1710 (“16”) of database table 1701a. The updated data record 1711 is then stored in target database 922and process control is passed to decision 1803 until all data recordshave been processed.

Once the foreign key database columns that relate to the unifiedboundary database table are populated, the database access paths, suchas bidirectional database access path 1715 of database 1700 a, from theunified boundary database tables to the rest of the database tables areestablished. All the data in the database may ultimately be stated interms of the fundamental business key attributes provided by the unifiedboundary database tables.

FIG. 19 shows detailed flow chart 1900 that details activity 917 ofmaster flow chart 900 shown in FIG. 9. The computer processor 4 asprogrammed by computer software stored in computer memory 8, implementsactivity 917, to achieve the database instantiation of summary databasetables in computer memory 8, such as summary database table 805 shown inFIG. 8. Detailed flow chart 1900 of activity 917 shown in FIG. 19 iscomposed of tasks 1901, 1903, 1908, 1911 and 1913, and of decision 1905which are implemented by computer processor 4, and of computer datastorage areas 920, 922 and 923 of computer memory 8, and of data flows1914, 1915 and 1916 and of process flow lines 1902, 1904, 1906, 1907,1909, 1910 and 1912, implemented by the computer processor 4. Computerdata storage area 920 may be a specific portion of computer memory 8shown in FIG. 1 which contains the data models of the databases to beconverted. Computer data storage area 922 may be a specific portion ofcomputer memory 8 shown in FIG. 1 which contains the target databasethat is to be converted into a standardized homogeneous database.Computer data storage area 923 may be a specific portion of computermemory 8 shown in FIG. 1 which contains the reusable unified metadatadictionary.

The computer processor 4 is programmed to implement task 1901 ofdetailed flow chart 1900 to retrieve the standardized homogeneous datamodel from computer data storage area 920 as shown by data flow 1914.This data model will contain a standardized homogeneous ERD, such as ERD700 shown in FIG. 7. One or more summary data entities, such as summarydata entity 705 of ERD 700, will be added to the ERD, in the computermemory 8. Data entity relationships, such as data entity relationships707, 709, 711 and 713 of ERD 700, are added to the summary data entitiesto form direct relations between the summary data entities and theappropriate unified boundary data entities such as unified boundary dataentities 701, 702, 703 and 704 of ERD 700. In at least one embodiment,the summary data entity name needs to conform to the naming standarddefined in the unified metadata dictionary maintained in computer datastorage area 923 which is retrieved by the computer processor 4 asdetailed by data flow 1916. Once the summary data entity has been addedto the standardized homogeneous ERD along with the required data entityrelationships, task 1901 is complete. Process control is then passedfrom task 1901 to task 1903 via process flow line 1902.

The computer processor 4 as programmed by computer software stored incomputer memory 8, implements task 1903, of detailed flow chart 1900, toadd data attributes to the summary data entity in computer memory 8,such as summary data entity 705 depicted in ERD 700 shown in FIG. 7. Inat least one embodiment, each data attribute added to the summary dataentity needs to conform to the metadata standard defined and maintainedin the unified metadata dictionary maintained in computer data storagearea 923, in computer memory 8, as shown in detailed flow chart 1900. Inorder to provide a complete standardized homogeneous database layeracross multiple databases, the unified metadata dictionary is designedto be reusable for these multiple databases. For each data attributeadded to the summary data entity in task 1903, process control is passedto decision 1905 as indicated by process flow line 1904. The computerprocessor 4 determines if unified metadata dictionary 923 containsmetadata for the added data attribute at decision 1905. If the metadatafor the added data attribute is contained in unified metadata dictionary923, that metadata is used, by the computer processor 4 when adding thedata attribute to the summary data entity. Once the data attribute hasbeen completely annotated, process control is returned to task 1903 viaprocess flow lines 1906 and 1902 to add the remaining data attributes.If the data attribute to be added to summary data entity is not found bythe computer processor 4, in unified metadata dictionary 923, thenprocess control is passed to task 1908 as indicated by process flow line1907.

In task 1908 of detailed flow chart 1900, the complete metadata for thenew data attribute is entered into the computer processor 4, then,stored into unified metadata dictionary 923, in computer memory 8 asindicated by data flow 1916. Once the metadata entry is saved and thedata attribute is added to the summary data entity, process control ispassed back to task 1903 as indicated by process flow lines 1909, 1906and 1902. Once all of the data attributes have been added to the summarydata entity, the computer processor 4 saves the standardized homogeneousdata model in computer data storage area 920 in computer memory 8 viadata flow 1914. This completes task 1903 and process control, asexecuted by computer processor 4 as programmed by computer software, isthen passed to task 1911 as indicated by process flow line 1910.

In task 1911 of detailed flow chart 1900, the computer processor 4 isused to retrieve the completed standardized homogeneous data model fromcomputer data storage area 920 in computer memory 8 as indicated by dataflow 1914. From this data model, summary database tables and theirforeign key constraints are database instantiated by the computerprocessor 4 into the standardized homogeneous database, such as database800 shown in FIG. 8, and are stored in computer data storage area 922,in computer memory 8, as indicated by data flow 1915. The instantiatedsummary database table will not contain any data records at this time.Once the database objects have been instantiated from the standardizedhomogeneous data model into the standardized homogeneous database,process control as implemented by computer processor 4, will be passedto task 1913 as indicated by process flow line 1912.

In task 1913, the summary database tables, such as summary databasetable 805 of database 800 shown in FIG. 8, are populated in computermemory 8, by the computer processor 4 as programmed by computer softwarein the computer memory 8, by aggregating the data values alreadycontained within the database in other database tables, such as databasetables 606 and 608 also from database 800. The computer software used topopulate each summary table will be unique as the source databasetables, such as database tables 606 and 608, contain heterogeneousmetadata. This completes activity 917 as seen in the detailed flow chart1900 of FIG. 19.

FIG. 20 shows ERD 1400 b, which is the result of the computer processor4 adding summary data entity 2001 and data entity relationships 2002 and2011 to ERD 1400 a that is shown in FIG. 14B. This modification of ERD1400 a to form ERD 1400 b is achieved by computer processor 4 asprogrammed by computer software to perform activity 917 of detailed flowchart 1900 as depicted in FIG. 19. In ERD 1400 b, data entities 1401,1402 and 1403 as well as data entity relationships 1404 and 1405represent a target data model to be converted into a standardizedhomogeneous data model and are the same data entities and data entityrelationships as appear in ERD 1400 shown in FIG. 14A. Unified boundarydata entity 1201 and data entity relationship 1422 were added previouslyas part of the conversion of the target ERD to the standardizedhomogeneous ERD depicted in ERD 1400 a shown in FIG. 14B. Data entities1201, 1401, 1402 and 1403 a and data entity relationships 1404, 1405 and1422 that appear in both FIGS. 14B and 20 are the same data entities anddata entity relationships.

Summary data entity 2001, depicted in ERD 1400 b shown in FIG. 20, hasdata entity name 2003, named “MK Account Month”. Summary data entityname 2003 is determined by the computer processor 4 as programmed bycomputer software in computer memory 8, from the unified metadatadictionary computer data storage area 923 using task 1901 and data flow1916 shown in detailed flow chart 1900 shown in FIG. 19. Summary dataentity 2001 contains a composite primary key composed of data attribute2004 named “MK Time Period ID” and data attribute 2005 named “AccountNumber”. Please note that primary key data attribute 2004 is also aforeign key data attribute denoted (FK1) in summary data entity 2001 andis the inheritance result of data entity relationship 2002 shown inentity-relationship 1400 b. Foreign key data attribute 2004 is inheritedfrom data attribute 1203 of unified boundary data entity 1201. Also, theinherited foreign key data attribute 2004 inherits the metadata for dataattribute 1203 including the data attribute name. Also, please note thatprimary key data attribute 2005 is also a foreign key data attributedenoted (FK2) in summary data entity 2001 and is the inheritance resultof data entity relationship 2011 shown in ERD 1400 b. Foreign key dataattribute 2005 is inherited from data attribute 1411 of data entity1402. Also, the inherited foreign key data attribute 2005 inherits themetadata for data attribute 1411 including the data attribute name. Dataattribute 1411 of data entity 1402 represents reference data that hasnot been incorporated into a unified boundary data entity at this time,but could be addressed later if needed.

Data attributes 2006, 2007, 2008, 2009 and 2010 shown in summary dataentity 2001 of ERD 1400 b, were added by the computer processor 4 asprogrammed by computer software stored in computer memory 8 using tasks1903 and 1908 along with computer data storage areas 923 and 920depicted in detailed flow chart 1900 shown in FIG. 19. The metadata ofeach data attribute added to summary data entity 2001 is stored forreuse in the unified metadata dictionary contained in computer datastorage area 923 shown in detailed flow chart 1900 shown in FIG. 19. Theuse of the unified metadata dictionary insures that summary data entitycontains reusable metadata and may therefore be included in thehomogeneous layer of the data model along with the unified boundary dataentities.

The summary data entities, such as summary data entity 2001 of ERD 1400b, along with the unified boundary data entities, such as unifiedboundary data entity 1201 of ERD 1400 b, define a standardizedhomogeneous database layer. In order to develop a standardizedhomogeneous database layer, a unified metadata dictionary needs to bedefined and maintained, such as the unified metadata dictionary storedin computer data storage area 923 of the computer memory 8, as shown indetailed flow chart 1900 shown in FIG. 19. In at least one embodiment,this unified metadata dictionary needs to be available to everyone thatwants to participate in designing standardized homogeneous databases.

It is very important to note that the standardized homogeneous databaselayer may be considered to be a data warehouse type database that isused to augment an existing transactional database. Summary dataentities, such as summary data entity 2001 of ERD 1400 b shown in FIG.20, are basically fact type data entities and the unified boundary dataentities, such as unified boundary data entity 1201 of ERD 1400 b, aredimension-type data entities. The combination of fact-type data entitiesand of dimension-type data entities form a data warehouse type ERD.

ERD 1400 b indicates that summary data entity 2001 may be joined to bothunified boundary data entity 1201 and/or data entity 1402. Summary table2001 may now be used as a data warehouse type application where thesummary data values such as those represented by data attribute 2008,2009 and 2010 stored at the month level a data granularity, may beaggregated to quarterly and yearly results using unified boundary dataentity 1201.

ERD 1400 b indicates that summary data entity 2001 data records may bejoined to data entity 1403 a that represent transaction level datarecords via unified boundary data entity 1201 and/or via data entity1402. The resultant joined data records could result in, for example,the detailed list of transaction data records that contribute to aspecific summary data record as a function of time periods, from unifiedboundary data entity 1201, or as a function of account numbers, fromdata entity 1402, or as a function of both time periods and accountnumbers.

FIG. 21 depicts database 1700 b which focuses upon the addition ofsummary database table 2101 and it's relation to unified boundarydatabase table 1601 via foreign key constraint 2112. Please note thatdatabase 1700 b, shown in FIG. 21, and database 1700 a, shown in FIG.17B; both represent a part of the same database where database table1601 is common to both representations. Database 1700 a, results fromthe computer processor 4 implementing activity 915, while database 1700b, results from the computer processor 4 implementing activity 917,where both activities are depicted in master flow chart 900 shown inFIG. 9.

Summary database table 2101, unified boundary database table 1601, andforeign key constraint 2112 of database 1700 b, which is shown in FIG.21, were instantiated from summary data entity 2001, unified boundarydata entity 1201, and data entity relationship 2002 respectively of ERD1400 b shown in FIG. 20. The database instantiation of the summarydatabase table and the foreign key constraints is directed by task 1911of detailed flow chart 1900 shown in FIG. 19. Summary database tablename 2102 of database 1700 b, named “MK Account Month”, is the result ofdatabase instantiating summary data entity name 2003, named “MK AccountMonth” which is shown in FIG. 20. Database columns 2103, 2104, 2105,2106, 2107, 2108 and 2109 of summary database table 2101, shown in FIG.21, result from the database instantiation of data attributes 2004,2005, 2006, 2007, 2008, 2009 and 2010 respectively of summary dataentity 2001 depicted in data model 1400 b as shown in FIG. 20.

The computer processor 4 is programmed by computer software stored incomputer memory 8 to use the foreign key constraint 2112 to constrainthe data values of database column 2103 of database table 2101 basedupon the data values in database columns 1603 of database table 1601.Foreign key constraint 2112 is used by the computer processor 4 tomaintain the database referential integrity between database table 2101and database table 1601 and to support the bidirectional database accesspath between these two database tables.

Summary database table 2101 is populated, by the computer processor 4,with data records such as data records 2110 and 2111 that result fromthe aggregation of the data records in database table 1701 a that isshown in FIG. 17B. This population of the summary table would normallybe accomplished using prior art methods and the combination of the dataavailable in database table 1701 a and the data available in unifiedboundary database table 1601 shown in FIG. 17B. The population of thesummary database tables, such as summary database table 2101, isachieved by task 1913, as implemented by the computer processor 4 asshown in detailed flow chart 1900 in FIG. 19.

Summary database tables, such as database table 2101, along with theunified boundary database tables, such as unified boundary databasetable 1601, form the standardized homogeneous layer of any database. Theuse of the unified metadata dictionary is very important, in at leastone embodiment, for providing reusable metadata for multiple databases.Again, metadata is always used to access data records in databasetables. Without the reusable metadata across databases, the ability tointegrate summary data across databases would be very limited.

FIG. 22A shows computer environment 2200 that contains independentheterogeneous database 2201 and contains independent heterogeneousdatabase 2202. These two prior art databases may exist on the samecomputer, or may exist on two different computers that may be connectedby a computer network. In any event, these two databases are isolatedfrom each other in that they contain no deliberate metadata commonalityand no deliberate data set commonality. Attempting to join data recordsfrom database 2201 with data records from database 2202 would bedifficult simply because nether database 2210 nor database 2202 weredesigned to support the joining of data records beyond their owndatabase boundary. That is, database referential integrity is notsupported beyond each database boundary and database access paths arenot provided beyond each database boundary. Neither database contains astandardized homogeneous database layer. Neither of these databasescontains a data warehouse that is integrated with the databasesheterogeneous transactional data set. Each of these databases supports aunique local boundary of database tables and a unique independentnetwork of database access paths. Prior art databases are very muchisolated from each other because of prior art database design methodsthat do not address the sharing of data sets beyond the databaseboundary.

FIG. 22B shows computer environment 2200 a which contains databases 2201a and 2202 a. Independent heterogeneous databases 2201 and 2202, bothshown in FIG. 22A, have both been converted, by the computer processor 4as programmed by computer software, to standardized homogeneousdatabases 2201 a and 2202 a respectively, both of which are now shown inFIG. 22B. These two standardized homogeneous databases may be on thesame computer, or may exist on two different computers that may beconnected by a computer network. Unified boundary database tables 2203 aand 1601 a, summary database table 2207, and foreign key constraints2209, 2210, 2211 and 2212 have been added to database 2201, shown inFIG. 22A, by the computer processor 4 as programmed by computer softwarestored in computer memory 8, to form standardized homogeneous database2201 a. Unified boundary database tables 2203 b and 1601 b, summarydatabase table 2208, and foreign key constraints 2213, 2214, 2215 and2216 have been added to database 2202, shown in FIG. 22A, by computerprocessor 4 as programmed by computer software stored in computer memory8, to form standardized homogeneous database 2202 a. Unified boundarydatabase tables 2203 a and 2203 b are structurally exact copies and arepopulated in computer memory 8 by the computer processor 4 using thesame standardized process. Unified boundary database tables 1601 a and1601 b are structurally exact copies and are populated in computermemory 8 by the computer processor 4 using the same standardizedprocess. The structure of these two summary database tables 2207 and2208 is not necessarily the same but both summary database tables arebased upon the unified metadata dictionary, such as unified metadatadictionary 923 of detailed flow chart 1900 shown in FIG. 19. Computerenvironment 2200 a, which is shown in FIG. 22B, also depicts databasebridges 2217 and 2218. Each database bridge provides a bidirectionalinter-database access path that allows for the combination of a data setfrom one standardized homogeneous database, such as database 2201 a,with a data set the other standardized homogeneous database, such asdatabase 2202 a.

All prior art databases, such as database 2201 shown in FIG. 22A, have alocal database boundary beyond which database access paths that aremaintained by foreign key constraints do not exist. The use of unifiedboundary database tables, for standardized homogeneous databases 2201 aand 2202 a, provides a unified boundary of database tables to bothdatabases. This standardized boundary of database tables provides bothmetadata commonality and data set commonality to each database.

Upon conversion of a prior art database, such as database 2201 shown inFIG. 22A, into a standardized homogeneous database, such as database2201 a shown in FIG. 22B, the database referential integrity and thebidirectional database access paths will be extended beyond the originallocal database boundary of the database. The database management systemfor database 2201 a will provide database referential integrity supportfor unified boundary database tables with foreign key constraints 2209,2210, 2211 and 2212. The database management system for database 2202 awill provide database referential integrity support with foreign keyconstraints 2213, 2214, 2215 and 2216.

Referential integrity of database bridges, such as database bridge 2218shown in computer environment 2200 a, is not currently enforced by thedatabase management system software applications. Instead, the databasebridge referential integrity must be maintained by the procedures usedto define and used to populate the unified boundary database tables withstandardized homogeneous data records. Unified boundary database tables1601 a and 1601 b of computer environment 2200 a are both databaseinstantiated from a single unified boundary data entity, such as unifiedboundary data entity 1201 of ERD 1200 shown in FIG. 12. In addition,instantiated unified boundary database tables 1601 a and 1601 b are bothpopulated by computer processor 4 with unified homogeneous data recordsusing the same standardized procedure. Now, both populated unifiedboundary database tables 1601 a and 1601 b are the same as populatedunified boundary database table 1601 shown in database 1600 shown inFIG. 16. Since both unified database tables 1601 a and 1601 b arepopulated with the same data records, combining standardized homogeneousdata records from both of these unified boundary database tables wouldbe very simple. For example, the unique business key data values ofdatabase table 1601 a for a specific standardized homogeneous datarecord will always equal the unique business key data values of the samestandardized homogeneous data record of database table 1601 b. Now, thedata set of database 2201 a may now be combined with the data set ofdatabase 2202 a via database bridges, such as database bridge 2217.

Any combination of transactional data and summary data may be combinedfrom database 2201 a and 2202 a. If unified boundary database tables areutilized that support multiple levels of data granularity, data recordsmay now be aggregated or allocated to support roll-up and drill-downdata warehouse functionality for any data records contained withineither database. Therefore, two different data records that exist atdifferent levels of data granularity may now be restated to a compatiblelevel of data granularity before these data records are combined. Theability to restated data records at a variety of data granularity addsflexibility to both databases that neither database had before theaddition of unified boundary database tables.

Both databases 2201 a and 2202 a contain a standardized homogeneousmetadata layer comprised from unified boundary database tables 1601 aand 2203 a and summary database table 2207 in database 2201 a andcomprised from unified boundary database tables 1601 b and 2203 b andsummary database table 2208 in database 2202 a. The standardizedhomogeneous metadata layer, based upon the unified metadata dictionary,provides reusability across multiple databases. When a specific dataelement is required, the unified metadata dictionary may be used tolocate that specific data element.

Database 2201 and database 2202 of computer environment 2200 shown inFIG. 22A were designed to be isolated from each other. Each database wasdesigned with a unique local boundary of database tables and a uniquenetwork of database access paths. However, database 2201 a and database2202 a of computer environment 2200 a shown in FIG. 22B were designed tobe integrated with each other. Now, each database has a common databaseboundary and a connected network of database access paths.

The computer environment 2200 a shown in FIG. 22B was for only twostandardized homogeneous databases, however, any database that is astandardized homogenous database may participate with any otherstandardized homogeneous database to provide integrated data sets.

1. A method comprising accessing a first repository of metadata in acomputer memory; using the first repository of metadata to set up andstore a first entity-relationship diagram in a first data model in acomputer memory prior to storing data values in a first database in acomputer memory, wherein the first entity-relationship diagram includesa first set of data attributes stored in computer memory; using acomputer processor to interpret the first entity-relationship diagram inthe first data model in order to form the first database; and storing afirst plurality of data records in a first database table, eachincluding a row of a plurality of data values, in the first database;accessing a second repository of metadata in a computer memory, whereinthe second repository of metadata and the first repository of metadataare substantially different; using the second repository of metadata toset up and store a second entity-relationship diagram in a second datamodel in a computer memory prior to storing data values in a seconddatabase in a computer memory, wherein the second entity-relationshipdiagram includes a second set of data attributes; using a computerprocessor to interpret the second entity-relationship diagram in thesecond data model in order to form the second database; and storing asecond plurality of data records in a second database table, eachincluding a row of a plurality of data values, in the second database;adding a first data entity and a first set of data entity relationshipsto the first entity-relationship diagram and storing in a computermemory; wherein the first data entity is added to the firstentity-relationship diagram as an ultimate parent data entity of thefirst data model; wherein the first set of data entity relationshipsconnect the first data entity to the first entity-relationship diagram;adding the first data entity and a second set of data entityrelationships to the second entity-relationship diagram and storing in acomputer memory; wherein the first data entity is added to the secondentity-relationship diagram as an ultimate parent data entity of thesecond data model; wherein the second set of data entity relationshipsconnect the first data entity to the second entity-relationship diagram;wherein an ultimate parent data entity of the first data model does notinherit any foreign key data attributes from any other data entity ofthe first data model, wherein a foreign key data attribute is a nameddata field which is used to identify a column of data values after adatabase has been formed and wherein a foreign key data attribute isderived from data attributes that form a unique key of a data entity;and wherein an ultimate parent data entity of the second data model doesnot inherit any foreign key data attributes from any other data entityof the second data model, wherein a foreign key data attribute is anamed data field which is used to identify a column of data values aftera database has been formed and wherein a foreign key data attribute isderived from data attributes that form unique key of a data entity;wherein the first data entity is a component of the firstentity-relationship diagram which becomes a third database table in thefirst database, once the first database is instantiated from the firstentity-relationship diagram; and wherein the first data entity is acomponent of the second entity-relationship diagram which becomes afourth database table once the second database is instantiated from thesecond entity-relationship diagram.
 2. The method of claim 1 wherein thefirst data entity has metadata which is derived from a third repositoryof metadata stored in a computer memory, wherein the third repository ofmetadata is substantially different from the first and the secondrepositories of metadata; and further comprising using the metadata ofthe first data entity in the first data model and in the second datamodel; and further comprising storing a fundamental business key dataattribute in computer memory; wherein the fundamental business key dataattribute forms a unique key of the first data entity; and wherein thefundamental business key data attribute is based upon a fundamentalmeasurement; wherein a fundamental measurement is a measurement which isnot derived from other measurements and which is determined directlyfrom observation.
 3. The method of claim 2 wherein the first data entityis a dimensional data entity, such that the first data entity hasmultiple distinct levels of data record granularity.
 4. The method ofclaim 2 further comprising adding a second data entity and a third setof data entity relationships to the first entity-relationship diagramand storing in a computer memory, wherein the second data entity hasmetadata which is derived from a third repository of metadata stored ina computer memory, wherein the third repository of metadata issubstantially different from the first and the second repositories ofmetadata; adding the second data entity and a fourth set of data entityrelationships to the second entity-relationship diagram and storing in acomputer memory; and wherein the second data entity is a unifiedboundary data entity in the first entity-relationship diagram, such thatthe second data entity is stored in computer memory and does not inheritany foreign key data attributes from any other data entity of the firstentity-relationship diagram or of the second entity-relationshipdiagram; and further comprising storing a fundamental business key dataattribute in computer memory; wherein the fundamental business key dataattribute forms a unique key of the second data entity; wherein thefundamental business key data attribute is based upon a data registry,wherein the data registry is a set of data records that define referencedata; and further comprising allowing access to the set of data recordsof the data registry to a plurality of databases including the firstdatabase and the second database; wherein each of the first database andthe second database includes a first unified boundary database table;and further comprising using the second data entity to instantiate thesecond unified boundary database table in the first database and toinstantiate the second unified boundary database table in the seconddatabase; and populating the second unified boundary database table inthe first database and populating the second unified boundary databasetable in the second database by using the data registry.
 5. The methodof claim 4 wherein the second data entity is a dimensional data entity,such that the second data entity has multiple distinct levels of datarecord granularity.
 6. The method of claim 4 wherein the first dataentity is a dimensional data entity, such that the first data entity hasmultiple distinct levels of data record granularity; the second dataentity is a dimensional data entity, such that the second data entityhas multiple distinct levels of data record granularity; and furthercomprising adding a first summary data entity to the firstentity-relationship diagram in computer memory, wherein the firstsummary data entity has a fifth set of data entity relationships storedin computer memory, and wherein the first summary data entity hasmetadata which is derived from the third repository of metadata; whereinthe first summary data entity is derived from the first plurality ofdata attributes; wherein one of the fifth set of data entityrelationships of the first summary data entity connects the firstdimensional data entity to the first summary data entity; wherein one ofthe fifth set of data entity relationships of the first summary dataentity connects the second dimensional data entity to the first summarydata entity; and further comprising adding a second summary data entityto the second entity-relationship diagram in computer memory, whereinthe second summary data entity has a sixth set of data entityrelationships stored in computer memory, and wherein the second summarydata entity has metadata which is derived from the third repository ofmetadata; wherein the second summary data entity is derived from thesecond plurality of data attributes; and wherein one of the sixth set ofdata entity relationships of the second summary data entity connects thefirst dimensional data entity to the second summary data entity; andwherein one of the sixth set of data entity relationships of the secondsummary data entity connects the second dimensional data entity to thesecond summary data entity.
 7. The method of claim 1 further comprisingaccessing a third repository of metadata in a computer memory, whereinthe third repository of metadata is substantially different from thefirst and the second repositories of metadata; using the thirdrepository of metadata to set up and store a third entity-relationshipdiagram in a third data model in a computer memory; adding the firstdata entity to the third entity-relationship diagram in a computermemory, in a manner such that the first data entity does not inherit anyforeign key data attributes from any other data entity of the thirdentity-relationship diagram; wherein when the first data entity is addedto the third entity-relationship diagram the third entity-relationshipdiagram is not linked to any populated database; and wherein the firstdata entity is formed from the third repository of metadata.
 8. Themethod of claim 7 further comprising storing a fundamental business keydata attribute in computer memory; wherein the fundamental business keydata attribute uniquely identifies the first data entity; and whereinthe fundamental business key data attribute is based upon a fundamentalmeasurement; wherein a fundamental measurement is a measurement which isnot derived from other measurements and which is determined directlyfrom observation.
 9. The method of claim 8 wherein the first data entityis a dimensional data entity, such that the first data entity hasmultiple distinct levels of data record granularity.
 10. The method ofclaim 1 further comprising adding a first summary data entity and athird set of data entity relationships to the first entity relationshipdiagram stored in computer memory, wherein the first summary data entityis formed from the first plurality of data attributes; wherein one ofthe third set of data entity relationships of the first summary dataentity connects the first data entity to the first summary data entity.11. The method of claim 10 wherein the first data entity is adimensional data entity, such that the first data entity has multipledistinct levels of data record granularity.
 12. A method comprisingforming a first database in a computer memory, wherein the firstdatabase includes a first set of database tables and a first set offoreign key constraints; wherein the first set of database tables has afirst plurality of database columns; adding a first unified boundarydatabase table and a second set of foreign key constraints to the firstdatabase in the computer memory; wherein the first unified boundarydatabase table does not inherit any of the first plurality of databasecolumns from any of the first set of database tables and adding thefirst unified boundary database table does not change any of the firstset of foreign key constraints; wherein the first unified boundarydatabase table has a second plurality of database columns, which includeone or more fundamental business key database columns; wherein the firstunified boundary database table has a unique database index which isbased upon one or more fundamental business key database columns;wherein each of the one or more fundamental business key databasecolumns is based upon a fundamental measurement or is based upon a dataregistry of reference data; wherein a fundamental measurement is ameasurement which is not derived from other measurements and which isdetermined directly from observation; wherein the data registry is a setof reference data stored in computer memory; wherein the set ofreference data includes a plurality of data records; wherein theplurality of data records includes a plurality of data values, whereinone or more of the plurality of data values uniquely identifies each ofthe plurality of data records; wherein each of the second set of foreignkey constraints references a unique database index associated with thefirst unified boundary database table; wherein the unique database indexis based upon one or more of the second plurality of database columns ofthe first unified boundary database table; wherein the unique databaseindex is used to uniquely identify each data record of a plurality ofdata records stored in the first unified boundary database table;wherein each of the foreign key constraints of the second set of foreignkey constraints is used by a computer processor to instantiate incomputer memory one or more foreign key database columns into a singledatabase table of the first set of database tables, so that a firstplurality of foreign key database columns is instantiated by the secondset of foreign key constraints; and wherein the first plurality offoreign key database columns are duplicates of the one or more databasecolumns that form the basis of the unique database index of the firstunified boundary database table.
 13. The method of claim 12 wherein thefirst unified boundary database table is a dimensional database tablesuch that the first unified boundary database table has multipledistinct levels of data record granularity.
 14. The method of claim 12further comprising adding a second unified boundary database table and athird set of foreign key constraints to the first database in thecomputer memory; wherein the second unified boundary database table doesnot inherit any of the first plurality of database columns from any ofthe first set of database tables and adding the second unified boundarydatabase table does not change any of the first set of foreign keyconstraints; wherein the second unified boundary database table has athird plurality of database columns, which include one or morefundamental business key database columns; wherein the second unifiedboundary database table has a unique database index which is based uponone or more fundamental business key database columns of the thirdplurality of database columns; wherein each of the third set of foreignkey constraints references a unique database index associated with thesecond unified boundary database table; wherein the unique databaseindex of the second unified boundary database table is based upon one ormore of the third plurality of database columns of the second unifiedboundary database table; wherein the unique database index of the secondunified boundary database table is used to uniquely identify each datarecord of a plurality of data records stored in the second unifiedboundary database table; wherein each of the foreign key constraints ofthe third set of foreign key constraints is used by a computer processorto instantiate in computer memory one or more foreign key databasecolumns into a single database table of the first set of databasetables, so that a second plurality of foreign key database columns isinstantiated by the third set of foreign key constraints; and whereinthe second plurality of foreign key database columns instantiated by thethird set of foreign key constraints are duplicates of the one or moredatabase columns that form the basis of a unique database index of thesecond unified boundary database table.
 15. The method of claim 14wherein the second unified boundary database table is a dimensionaldatabase table such that the second unified boundary database table hasmultiple distinct levels of data record granularity.
 16. The method ofclaim 14 further comprising adding a first summary database table to thefirst database in computer memory; wherein the first summary databasetable is comprised of a fourth plurality of database columns that arebased on the first plurality of database columns and a fifth pluralityof database columns that are based on the third plurality of foreign keydatabase columns and the fourth plurality of foreign key databasecolumns; adding a fourth set of foreign key constraints to the firstdatabase in computer memory; wherein one of the fourth set of foreignkey constraints connects the first unified boundary database table tothe first summary database table; wherein the first summary databasetable inherits the third plurality of foreign key database columns fromthe first unified boundary database table, such that the third pluralityof foreign key database columns are stored in the first summary databasetable in computer memory; and wherein the third plurality of foreign keydatabase columns from the first unified boundary database table are partof the fifth plurality of database columns of the first summary databasetable; wherein a second one of the fourth set of foreign key constraintsconnects the second unified boundary database table to the first summarydatabase table; wherein the first summary database table inherits thefourth plurality of foreign key database columns from the second unifiedboundary database table; and wherein the fourth plurality of foreign keydatabase columns from the second unified boundary database table arepart of the fifth plurality of database columns for the first summarydatabase table.
 17. The method of claim 16 wherein the first unifiedboundary database table is a dimensional database table such that thefirst unified boundary database table has multiple distinct levels ofdata record granularity; and the second unified boundary database tableis a dimensional database table such that the second unified boundarydatabase table has multiple distinct levels of data record granularity.18. The method of claim 16 further comprising adding a third unifiedboundary database table and a fifth set of foreign key constraints tothe first database in the computer memory; wherein the third unifiedboundary database table does not inherit any of the first plurality ofdatabase columns from any of the first set of database tables and addingthe third unified boundary database table does not change any of thefirst set of foreign key constraints; wherein the third unified boundarydatabase table has a sixth plurality of database columns, which includeone or more fundamental business key database columns; wherein the thirdunified boundary database table has a unique database index which isbased upon one or more fundamental business key database columns of thesixth plurality of database columns; wherein each of the fifth set offoreign key constraints references a unique database index associatedwith the third unified boundary database table; wherein the uniquedatabase index of the third unified boundary database table is basedupon one or more of the sixth plurality of database columns of the thirdunified boundary database table; wherein the unique database index ofthe third unified boundary database table is used to uniquely identifyeach data record of a plurality of data records stored in the thirdunified boundary database table; wherein each of the foreign keyconstraints of the fifth set of foreign key constraints is used by acomputer processor to instantiate in computer memory one or more foreignkey database columns into a single database table of the first set ofdatabase tables, so that a plurality of foreign key database columns isinstantiated by the fifth set of foreign key constraints; and whereinthe plurality of foreign key database columns instantiated by the fifthset of foreign key constraints are duplicates of the one or moredatabase columns that form the basis of a unique database index of thethird unified boundary database table.
 19. The method of claim 18wherein the third unified boundary database table is a dimensionaldatabase table such that the third unified boundary database table hasmultiple distinct levels of data record granularity.
 20. The method ofclaim 19 further comprising adding a second summary database table tothe first database in computer memory; wherein the second summarydatabase table is comprised of a seventh plurality of database columnsthat are based on the first plurality of database columns and a eighthplurality of database columns that are based on the third plurality offoreign key database columns, the fourth plurality of database columnsand the fifth plurality of foreign key database columns; adding a sixthset of foreign key constraints to the first database in computer memory;wherein a first foreign key constraint of the sixth set of foreign keyconstraints connects the first unified boundary database table to thesecond summary database table; wherein the second summary database tableinherits the third plurality of foreign key database columns from thefirst unified boundary database table, such that the third plurality offoreign key database columns are stored in the second summary databasetable in computer memory; and wherein the third plurality of foreign keydatabase columns from the first unified boundary database table are partof the eight plurality of database columns of the second summarydatabase table; wherein a second foreign key constraint of the sixth setof foreign key constraints connects the second unified boundary databasetable to the second summary database table; wherein the second summarydatabase table inherits the fourth plurality of foreign key databasecolumns from the second unified boundary database table, such that thefourth plurality of foreign key database columns are stored in thesecond summary database table in computer memory; and wherein the fourthplurality of foreign key database columns from the second unifiedboundary database table are part of the eighth plurality of databasecolumns for the second summary database table; wherein a third foreignkey constraint of the sixth set of foreign key constraints connects thethird unified boundary database table to the second summary databasetable; wherein the second summary database table inherits the fifthplurality of foreign key database columns from the third unifiedboundary database table, such that the fifth plurality of foreign keydatabase columns are stored in the second summary database table incomputer memory; and wherein the fifth plurality of foreign key databasecolumns from the third unified boundary database table are part of theeighth plurality of database columns of the second summary databasetable.
 21. A method comprising forming a first database in a computermemory from a first repository of metadata in a computer memory; whereinthe first database includes a first set of database tables and a firstset of foreign key constraints; wherein the first set of database tableshas a first plurality of database columns; populating the first databasewith data records after the first database is formed; forming a seconddatabase in a computer memory from a second repository of metadata in acomputer memory, wherein the second database includes a second set ofdatabase tables and a second set of foreign key constraints; wherein thesecond set of database tables has a second plurality of databasecolumns; wherein the second repository of metadata is substantiallydifferent from the first repository of metadata; populating the seconddatabase with data records after the second database is formed; adding afirst database table and a third set of foreign key constraints to thefirst database after the first database has been populated, and storingthe first database table and the third set of foreign key constraintsadded to the first database in a computer memory, wherein the third setof foreign key constraints connect the first database table to one ormore database tables in the first database; and adding the firstdatabase table and a fourth set of foreign key constraints to the seconddatabase after the second database has been populated, and storing thefirst database table and the fourth set of foreign key constraints addedto the second database in a computer memory, wherein the fourth set offoreign key constraints connect the first database table to one or moredatabase tables in the second database; populating the first databasetable in the first database from a first set of data records; andpopulating the first database table in the second database from thefirst set of data records.
 22. The method of claim 21 wherein the firstdatabase table is a dimensional database table, such that the firstdatabase table has multiple distinct levels of data record granularity.23. The method of claim 21 wherein wherein the first database table doesnot inherit any of the first plurality of database columns from any ofthe first set of database tables in the first database and adding thefirst database table does not change any of the first set of foreign keyconstraints; wherein the first database table does not inherit any ofthe second plurality of database columns from any of the second set ofdatabase tables in the second database and adding the first databasetable does not change any of the second set of foreign key constraints;wherein the first database table has a third plurality of databasecolumns, which include one or more fundamental business key databasecolumns; wherein the first database table has a unique database indexwhich is based upon one or more fundamental business key databasecolumns from the third plurality of database columns; wherein each ofthe one or more fundamental business key database columns is based upona fundamental measurement or is based upon a data registry of referencedata; wherein the fundamental measurement is a measurement which is notderived from other measurements and which is determined directly fromobservation; wherein the data registry is a set of reference data storedin computer memory; wherein the set of reference data includes aplurality of data records; wherein the plurality of data recordsincludes a plurality of data values, wherein one or more of theplurality of data values uniquely identifies each of the plurality ofdata records; wherein each of the third and the fourth set of foreignkey constraints references a unique database index associated with thefirst database table; wherein the unique database index is based uponone or more of the third plurality of database columns of the firstdatabase table; wherein the unique database index is used to uniquelyidentify each data record of a plurality of data records stored in thefirst database table; wherein each of the foreign key constraints of thethird set of foreign key constraints is used by a computer processor toinstantiate in computer memory one or more foreign key database columnsinto a single database table of the first set of database tables, sothat a plurality of foreign key database columns is instantiated by thethird set of foreign key constraints; wherein each of the foreign keyconstraints of the fourth set of foreign key constraints is used by acomputer processor to instantiate in computer memory one or more foreignkey database columns into a single database table of the second set ofdatabase tables, so that a plurality of foreign key database columns isinstantiated by the fourth set of foreign key constraints; and whereinthe plurality of foreign key database columns are duplicates of the oneor more database columns that form the basis of the unique databaseindex.
 24. The method of claim 23 wherein the first database table is adimensional database table, such that the first database table hasmultiple distinct levels of data record granularity.
 25. The method ofclaim 21 further comprising adding a second database table and a fifthset of foreign key constraints to the first database in computer memory,and storing the second database table and the fifth set of foreign keyconstraints added to the first database in a computer memory, whereinthe fifth set of foreign key constraints connect the second databasetable to one or more database tables in the first database; adding asecond database table and a sixth set of foreign key constraints to thesecond database in computer memory, and storing the second databasetable and the sixth set of foreign key constraints added to the firstdatabase in a computer memory, wherein the sixth set of foreign keyconstraints connect the second database table to one or more databasetables in the second database; populating the second database table inthe first database from a second set of data records; and populating thesecond database table in the second database from the second set of datarecords; and wherein the first database table and the second databasetable are formed from a third repository of metadata that issubstantially different from the first repository of metadata and thesecond repository of metadata.
 26. The method of claim 25 furthercomprising using a computer processor to add a first summary databasetable to the first database in computer memory; wherein the firstsummary database table is comprised of a third plurality of databasecolumns have their data values derived from the data values of the firstplurality of database columns of the first database and a fourthplurality of database columns that are based on a first plurality offoreign key database columns of the first database and a secondplurality of foreign key database columns of the first database; whereinthe metadata of the third plurality of database columns is formed fromthe third repository of metadata; using a computer processor to add aseventh set of foreign key constraints to the first database in computermemory; wherein one of the seventh set of foreign key constraintsconnects a first database table of the first database to the firstsummary database table of the first database; wherein the first summarydatabase table inherits the first plurality of foreign key databasecolumns from the first database table of the first database, such thatthe first plurality of foreign key database columns are stored in thefirst summary database table of the first database in computer memory;and wherein the first plurality of foreign key database columns from thefirst database table of the first database are part of the fourthplurality of database columns of the first summary database table;wherein a second one of the seventh set of foreign key constraintsconnects the second database table of the first database to the firstsummary database table; wherein the first summary database tableinherits the second plurality of foreign key database columns from thesecond database table of the first database; and wherein the secondplurality of foreign key database columns from the second database tableof the first database are part of the fourth plurality of databasecolumns for the first summary database table.
 27. The method of claim 26wherein the first database table is a unified database table; whereinthe first unified boundary database table does not inherit any of thefirst plurality of database columns from any of the first set ofdatabase tables and adding the first unified boundary database tabledoes not change any of the first set of foreign key constraints in thefirst database; wherein the first unified boundary database table doesnot inherit any of the second plurality of database columns from any ofthe second set of database tables and adding the first unified boundarydatabase table does not change any of the second set of foreign keyconstraints in the second database; wherein the third plurality ofdatabase columns of the first unified boundary database table includeone or more fundamental business key database columns; wherein the firstunified boundary database table has a unique database index which isbased upon one or more fundamental business key database columns;wherein each of the one or more fundamental business key databasecolumns is based upon a fundamental measurement or is based upon a dataregistry of reference data; wherein a fundamental measurement is ameasurement which is not derived from other measurements and which isdetermined directly from observation; wherein the data registry is a setof reference data stored in computer memory; wherein the set ofreference data includes a plurality of data records; wherein theplurality of data records includes a plurality of data values, whereinone or more of the plurality of data values uniquely identifies each ofthe plurality of data records; wherein each of the third set of foreignkey constraints and the fourth set of foreign key constraints referencesa unique database index associated with the first unified boundarydatabase table; wherein the unique database index is based upon one ormore of the third plurality of database columns of the first unifiedboundary database table; wherein the unique database index is used touniquely identify each data record of a plurality of data records storedin the first unified boundary database table; wherein each of theforeign key constraints of the third set of foreign key constraints isused by a computer processor to instantiate in computer memory one ormore foreign key database columns into a single database table of thefirst set of database tables in the first database, so that a firstplurality of foreign key database columns is instantiated by the thirdset of foreign key constraints; wherein each of the foreign keyconstraints of the fourth set of foreign key constraints is used by acomputer processor to instantiate in computer memory one or more foreignkey database columns into a single database table of the second set ofdatabase tables in the second database, so that a first plurality offoreign key database columns is instantiated by the fourth set offoreign key constraints; and wherein the first plurality of foreign keydatabase columns are duplicates of the one or more database columns thatform the basis of the unique database index of the first unifiedboundary database table.
 28. The method of claim 26 wherein the firstdatabase table is a dimensional database table, such that the firstdatabase table has multiple distinct levels of data record granularity.